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.

PDF

unpublished.

@unpublished{fan24, title={Deductive Systems for Logic Programs with Counting}, author={Jorge Fandinno and Vladimir Lifschitz}, month={ }, url="http://www.cs.utexas.edu/users/ai-labpub-view.php?PubID=128052", year={2024} }