mlsanityData to 14 Oct 2026

Deductive Systems for Logic Programs with Counting

arXiv 2511.19565 ↗First posted 24 Nov 2025cs.LO cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of the other in an appropriate deductive system. This paper shows how to extend this method of proving strong equivalence to programs containing the counting aggregate.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 30 references that are in the map. First posted on arXiv 24 Nov 2025.

Builds on

5 of 30 references.

References · 5

  1. 2020Verifying Tight Logic Programs with anthem and Vampirecited by 13
  2. 2023External Behavior of a Logic Program and Verification of Refactoringcited by 3
  3. 2021Here and There with Arithmeticcited by 2
  4. 2022Strong Equivalence of Logic Programs with Countingcited by 2
  5. 2024Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalencecited by 1

Built on by

Not cited yet.