.png){kind=icon}
.png){kind=icon}
Return
Deductive Systems for Logic Programs with Counting
.png){kind=icon}
PRE
AI
DOI：10.1017/S1471068425100379.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
theory
answer set programming
verification
Journal
T
IF:
1.1
Papers:
24
Citations:
684
