Verifying the Equivalence of Logic Programs in the Disjunctive Case

In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint programs supported by the smodels system, is generalized to the disjunctive case. Moreover, we report on our preliminary experiments with an implementation of the method, a translator called dlpeq.

[1]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

[2]  Fangzhen Lin.  Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic , 2002, KR.

[3]  Jia-Huai You,et al.  Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.

[4]  Thomas Eiter,et al.  Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.

[5]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[6]  Stefan Woltran,et al.  A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report , 2002, NMR.

[7]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[8]  Tomi Janhunen.  On the Effect of Default Negation on the Expressiveness of Disjunctive Rules , 2001, LPNMR.

[9]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[10]  Michael Gelfond,et al.  The USA-Advisor: A Case Study in Answer Set Planning , 2001, LPNMR.

[11]  Hudson Turner,et al.  Strong equivalence made easy: nested expressions and weight constraints , 2003, Theory and Practice of Logic Programming.

[12]  Patrik Simons,et al.  GnT - Computing Disjunctive Stable Models, Version 2 , 2003 .

[13]  Vladimir Lifschitz,et al.  Weight constraints as nested expressions , 2003, Theory and Practice of Logic Programming.

[14]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[15]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[16]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[17]  Tomi Janhunen,et al.  Testing the Equivalence of Logic Programs under Stable Model Semantics , 2002, JELIA.

[18]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[19]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[20]  Stefan Woltran,et al.  Encodings for Equilibrium Logic and Logic Programs with Nested Expressions , 2001, EPIA.

[21]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[22]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[23]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[24]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[25]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.