Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs

Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Cabalar, Pearce, and Valverde, showed that any propositional theory under the stable model semantics can be turned into a logic program. In this note, we present yet another proof of this result. Unlike the other approaches that are based on the logic of here-and-there, our proof uses familiar properties of classical logic. Based on this idea, we present a prototype implementation for computing stable models of propositional theories using the answer set solver DLV. We also note that every first-order formula under the stable model semantics is strongly equivalent to a prenex normal form whose matrix has the form of a logic program.

[1]  Joohyung Lee,et al.  A New Perspective on Stable Models , 2007, IJCAI.

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

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

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

[5]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[6]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

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

[8]  John McCarthy,et al.  Addendum: Circumscription and other Non-Monotonic Formalisms , 1980, Artif. Intell..

[9]  Stefan Woltran,et al.  nlp: A Compiler for Nested Logic Programming , 2004, LPNMR.

[10]  David Pearce,et al.  A First Order Nonmonotonic Extension of Constructive Logic , 2005, Stud Logica.

[11]  Pedro Cabalar,et al.  Propositional theories are strongly equivalent to logic programs , 2007, Theory Pract. Log. Program..

[12]  Vladimir Lifschitz,et al.  Mathematical Foundations of Answer Set Programming , 2005, We Will Show Them!.

[13]  David Pearce,et al.  Reducing Propositional Theories in Equilibrium Logic to Logic Programs , 2005, Answer Set Programming.

[14]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[15]  David Pearce,et al.  Minimal Logic Programs , 2007, ICLP.

[16]  Artur S. d'Avila Garcez,et al.  We Will Show Them! Essays in Honour of Dov Gabbay, Volume One , 2005, We Will Show Them!.

[17]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

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