mlsanityData to 13 Oct 2026

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

arXiv 2412.10975 ↗First posted 14 Dec 2024cs.AI cs.LOcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. Furthermore, this characterization can be used to study the strong equivalence of programs with aggregates under either semantics. We also present a transformation that reduces the task of checking strong equivalence to reasoning in classical First-Order logic, which serves as a foundation for automating this procedure.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 6 of its 40 references that are in the map. First posted on arXiv 14 Dec 2024.

Builds on

6 of 40 references.

References · 6

  1. 2020Verifying Tight Logic Programs with anthem and Vampirecited by 13
  2. 2018Vicious Circle Principle and Logic Programs with Aggregatescited by 4
  3. 2023First-Order Stable Model Semantics with Intensional Functionscited by 3
  4. 2019Relating Two Dialects of Answer Set Programmingcited by 2
  5. 2022Strong Equivalence of Logic Programs with Countingcited by 2
  6. 2018Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregatescited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

  1. 2025Deductive Systems for Logic Programs with Countingcited by 0