mlsanityData to 7 Oct 2026

Quantitative and Stream Extensions of Answer Set Programming

arXiv 2109.08281 ↗First posted 17 Sep 2021cs.LO cs.AI cs.CCcited by 0

Not on the map. Why?

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.

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

Builds on

5 of 34 references.

References · 5

  1. 2018Temporal Answer Set Programming on Finite Tracescited by 10
  2. 2020A Uniform Treatment of Aggregates and Constraints in Hybrid ASPcited by 8
  3. 2019Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs (Technical Report)cited by 6
  4. 2018Vicious Circle Principle and Logic Programs with Aggregatescited by 4
  5. 2020ASP(AC): Answer Set Programming with Algebraic Constraintscited by 3

Built on by

Not cited yet.