Complexity Results for Checking Equivalence of Stratified Logic Programs

Recent research in nonmonotonic logic programming under the answer-set semantics focuses on different notions of program equivalence. However, previous results do not address the important classes of stratified programs and its subclass of acyclic (i.e., recursion-free) programs, although they are recognized as important tools for knowledge representation and reasoning. In this paper, we consider such programs, possibly augmented with constraints. Our results show that in the propositional setting, where reasoning is well-known to be polynomial, deciding strong and uniform equivalence is as hard as for arbitrary normal logic programs (and thus coNP-complete), but is polynomial in some restricted cases. Nonground programs behave similarly. However, exponential lower bounds already hold for small programs (i.e., with constantly many rules). In particular, uniform equivalence is undecidable even for small Horn programs plus a single negative constraint.

[1]  Alon Y. Halevy,et al.  Static analysis in datalog extensions , 2001, JACM.

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

[3]  Peter Szolovits,et al.  What Is a Knowledge Representation? , 1993, AI Mag..

[4]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

[5]  David Pearce,et al.  Uniform Equivalence for Equilibrium Logic and Logic Programs , 2004, LPNMR.

[6]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[7]  Wolfgang Faber,et al.  Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming , 2004, KR.

[8]  Wolfgang Faber,et al.  Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming , 2003, Answer Set Programming.

[9]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[10]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[11]  Tomás Feder,et al.  Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations , 1992, ICDT.

[12]  Rina Dechter,et al.  Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.

[13]  Stefan Woltran,et al.  Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case , 2005, AAAI.

[14]  Georg Gottlob,et al.  On the Complexity of Single-Rule Datalog Queries , 1999, LPAR.

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

[16]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[17]  Wolfgang Faber,et al.  Strong Equivalence for Logic Programs with Preferences , 2005, IJCAI.

[18]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[19]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

[20]  Stefan Woltran,et al.  Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.

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

[22]  Michael Gelfond,et al.  Logic programming and knowledge representation—The A-Prolog perspective , 2002 .

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