Deductive Systems for Logic Programs with Counting
By: Jorge Fandinno, Vladimir Lifschitz
Potential Business Impact:
Makes computer programs with counting work the same.
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.
Similar Papers
Analysis of logics with arithmetic
Logic in Computer Science
Makes computers understand tricky math logic puzzles.
Programs Versus Finite Tree-Programs
Logic in Computer Science
Makes computer programs work like simple math.
The role of counting quantifiers in laminar set systems
Logic in Computer Science
Turns complex group rules into simple tree maps.