Abstract
This paper defines a general framework for testing equivalence of logic programs with respect to two parameters. Given two sets of rules \({\cal Q}\) and \({\cal R}\), two logic programs P 1 and P 2 are said to be update equivalent with respect to \(({\cal Q},{\cal R})\) if (P 1∖ Q)∪ R and (P 2∖ Q)∪ R have the same answer sets for any two logic programs \(Q\subseteq{\cal Q}\) and \(R\subseteq{\cal R}\). The notion of update equivalence is suitable to take program updates into account when two logic programs are compared. That is, the notion of relativity stipulates the languages of updates, and two parameters \({\cal Q}\) and \({\cal R}\) correspond to the languages for deletion and addition, respectively. Clearly, the notion of strong equivalence is a special case of update equivalence where \({\cal Q}\) is empty and \({\cal R}\) is the set of all rules in the language. In fact, the notion of update equivalence is strong enough to capture many other notions such as weak equivalence, update equivalence on common rules, and uniform equivalence. We also discuss computation and complexity of update equivalence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.