Well Founded Semantics for Logic Programs with Explicit Negation (1992)
| Venue: | EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE |
| Citations: | 120 - 54 self |
BibTeX
@INPROCEEDINGS{Pereira92wellfounded,
author = {Luís Moniz Pereira and José Júlio Alferes},
title = {Well Founded Semantics for Logic Programs with Explicit Negation},
booktitle = {EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE},
year = {1992},
pages = {102--106},
publisher = {John Wiley & Sons}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11]. This relationship improves the cross-fertilization between logic programs and default theories, since we generalize previous results concerning their relationship [3, 4, 7, 1, 2], and there is an increasing use of logic programming with explicit negation for nonmonotonic reasoning [7, 15, 16, 13, 23]. It also clarifies the meaning of logic programs combining both explicit negation and negation by default. In particular, it shows that explicit negation corresponds exactly to classical negation in the default theory, and elucidates the use of rules in logic programs. Like defaults, rules are unidirectional, so their contrapositives are not implicit; the rule connective, /, is not materi...
