English

Propositional theories are strongly equivalent to logic programs

Artificial Intelligence 2007-05-23 v1 Logic in Computer Science

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.

Keywords

Cite

@article{arxiv.cs/0701095,
  title  = {Propositional theories are strongly equivalent to logic programs},
  author = {Pedro Cabalar and Paolo Ferraris},
  journal= {arXiv preprint arXiv:cs/0701095},
  year   = {2007}
}

Comments

15 pages