Logic Programming with Default, Weak and Strict Negations
| dc.creator | Yamasaki, Susumu | |
| dc.date | 2005-11-10 | |
| dc.date.accessioned | 2026-07-07T06:49:35Z | |
| dc.date.available | 2026-07-07T06:49:35Z | |
| dc.description | This paper treats logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so that a soundness of the procedure is guaranteed in terms of 3-valued logic model theory. | |
| dc.description | 14 pages, to appear in Theory and Practice of Logic Programming (TPLP) | |
| dc.identifier | https://arxiv.org/abs/cs/0511041 | |
| dc.identifier | http://arxiv.org/abs/cs/0511041 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/104399 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.2; F.4.1; I.2.3 | |
| dc.title | Logic Programming with Default, Weak and Strict Negations | |
| dc.type | text |