An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning
| dc.creator | Bry, François | |
| dc.date | 2002-07-25 | |
| dc.date.accessioned | 2026-07-07T03:18:45Z | |
| dc.date.available | 2026-07-07T03:18:45Z | |
| dc.description | The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values; implications in N^4 are material, like in classical logic; and negation distributes over compound formulas in N^4 as it does in classical logic. Results suggest that the semantics of normal logic programs is conveniently formalized in N^4: Classical logic Herbrand interpretations generalize straightforwardly to N^4; the classical minimal Herbrand model of a positive logic program coincides with its unique minimal N^4 Herbrand model; the stable models of a normal logic program and its so-called complete minimal N^4 Herbrand models coincide. | |
| dc.description | 16 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/) | |
| dc.identifier | https://arxiv.org/abs/cs/0207091 | |
| dc.identifier | http://arxiv.org/abs/cs/0207091 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31240 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1; I.2.3; I.2.4; D.3.1 | |
| dc.title | An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning | |
| dc.type | text |