Propositional theories are strongly equivalent to logic programs
2007 ◽
Vol 7
(6)
◽
pp. 745-759
◽
AbstractThis 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.
2019 ◽
Vol 19
(04)
◽
pp. 603-628
◽
2019 ◽
Vol 19
(5-6)
◽
pp. 891-907
2011 ◽
Vol 13
(1)
◽
pp. 33-70
◽
Keyword(s):
2003 ◽
Vol 3
(2)
◽
pp. 129-187
◽
Keyword(s):
2007 ◽
Vol 7
(6)
◽
pp. 697-744
◽
Keyword(s):
2020 ◽
Vol 34
(03)
◽
pp. 2917-2924
Keyword(s):
2007 ◽
Vol 29
◽
pp. 353-389
◽