Propositional theories are strongly equivalent to logic programs

This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one involving a syntactic transformation, and one that constructs a program starting from the countermodels of the theory in the intermediate logic of here-and-there.

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

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

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

[4]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

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

[6]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

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

[8]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

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

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

[11]  A. Heyting.  Die formalen Regeln der intuitionistischen Logik , 1930 .

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

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

[14]  Lex Hendriks,et al.  Characterization of strongly equivalent logic programs in intermediate logics , 2002, Theory and Practice of Logic Programming.