# Quantitative and Stream Extensions of Answer Set Programming

arXiv: https://arxiv.org/abs/2109.08281 · HTML: https://mlsanity.com/paper/2109.08281/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 34 references that are in the map.
- First posted on arXiv 17 Sep 2021.

## Builds on (most cited first, 5 of 5)

- [Temporal Answer Set Programming on Finite Traces](https://mlsanity.com/paper/1804.10227/) (2018)
- [A Uniform Treatment of Aggregates and Constraints in Hybrid ASP](https://mlsanity.com/paper/2003.04176/) (2020)
- [Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs (Technical Report)](https://mlsanity.com/paper/1911.07750/) (2019)
- [Vicious Circle Principle and Logic Programs with Aggregates](https://mlsanity.com/paper/1808.07050/) (2018)
- [ASP(AC): Answer Set Programming with Algebraic Constraints](https://mlsanity.com/paper/2008.04008/) (2020)

## Abstract (arXiv)

Answer Set Programming has separately been extended with constraints, to the streaming domain, and with capabilities to reason over the quantities associated with answer sets. We propose the introduction and analysis of a general framework that incorporates all three directions of extension by exploiting the strengths of Here-and-There Logic and Weighted Logic.