Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
