Equivalence for the G '(3)-stable models semantics
We study the notion of strong equivalence between two disjunctive logic programs under the G'(3)-stable model semantics, also called the p-stable semantics, and we show how some particular cases of testing strong equivalence between programs can be reduced to checking whether a formula is a theorem in some paraconsistent logic, or in some cases in classical logic. We also present some program transformations for disjunctive programs which can be used to reduce the size of a program. (C) 2009 Elsevier B.V. All rights reserved.
equivalence p-stable semantics transformation g '(3) logic