pith. sign in

arxiv: cs/0701095 · v1 · submitted 2007-01-16 · 💻 cs.AI · cs.LO

Propositional theories are strongly equivalent to logic programs

classification 💻 cs.AI cs.LO
keywords logicequivalentprogrampropositionalstronglytheoriestheoryalways
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.