Propositional theories are strongly equivalent to logic programs
| dc.creator | Cabalar, Pedro | |
| dc.creator | Ferraris, Paolo | |
| dc.date | 2007-01-16 | |
| dc.date.accessioned | 2026-07-07T07:41:13Z | |
| dc.date.available | 2026-07-07T07:41:13Z | |
| dc.description | 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. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0701095 | |
| dc.identifier | http://arxiv.org/abs/cs/0701095 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/122028 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.title | Propositional theories are strongly equivalent to logic programs | |
| dc.type | text |