.png){kind=icon}
Return
Strongly equivalent logic programs
.png){kind=icon}
PRE
AI
DOI：10.1145/383779.383783.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A logic program Π
1
is said to be equivalent to a logic program Π
2
in the sense of the answer set semantics if Π
1
and Π
2
have the same answer sets. We are interested in the following stronger condition: for every logic program, Π, Π
1
, ∪ Π has the same answer sets as Π
2
∪ Π. The study of strong equivalence is important, because we learn from it how one can simplify a part of a logic program without looking at the rest of it. The main theorem shows that the verification of strong equivalence can be accomplished by cheching the equivalence of formulas in a monotonic logic, called the logic of here-and-there, which is intermediate between classical logic and intuitionistic logic.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available