Characterization of Strongly Equivalent Logic Programs in Intermediate Logics
| dc.creator | de Jongh, Dick | |
| dc.creator | Hendriks, Lex | |
| dc.date | 2002-06-03 | |
| dc.date.accessioned | 2026-07-07T03:18:29Z | |
| dc.date.available | 2026-07-07T03:18:29Z | |
| dc.description | The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper we will show that KC (the logic obtained by adding axiom ~A v ~~A to intuitionistic logic), is the weakest intermediate logic for which strongly equivalent logic programs, in a language allowing negations, are logically equivalent. | |
| dc.description | Under consideration for publication in Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0206005 | |
| dc.identifier | http://arxiv.org/abs/cs/0206005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31133 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6 | |
| dc.title | Characterization of Strongly Equivalent Logic Programs in Intermediate Logics | |
| dc.type | text |