TY - GEN
T1 - Integrating the completion and the well founded semantics
AU - Osorio, Mauricio
AU - Jayaraman, Bharat
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - The three most well-known semantics for negation in the logic programming framework are Clark’s completion [Cla78], the stable semantics [GL88], and the well-founded semantics [vGRS91]. Clark’s completion (COMP) was the first proposal to give a formal meaning to negation as failure. However, it is now accepted that COMP does not always captures the meaning of a logic program. Despite its computational and structural advantages, the well-founded semantics (WFS) is considered much too weak for real applications. The stable semantics (STABLE), on the other hand, is so strong that many programs become inconsistent. We present in this paper examples to support these claims, and we introduce a new semantics, called CWFS, which is as powerful as COMP in inferring positive literals and as powerful as WFS in inferring negative literals. Due to its particular construction, CWFS helps to un- derstand the relationship among COMP, WFS, and STABLE. We also discuss some implementation issues of CWFS.
AB - The three most well-known semantics for negation in the logic programming framework are Clark’s completion [Cla78], the stable semantics [GL88], and the well-founded semantics [vGRS91]. Clark’s completion (COMP) was the first proposal to give a formal meaning to negation as failure. However, it is now accepted that COMP does not always captures the meaning of a logic program. Despite its computational and structural advantages, the well-founded semantics (WFS) is considered much too weak for real applications. The stable semantics (STABLE), on the other hand, is so strong that many programs become inconsistent. We present in this paper examples to support these claims, and we introduce a new semantics, called CWFS, which is as powerful as COMP in inferring positive literals and as powerful as WFS in inferring negative literals. Due to its particular construction, CWFS helps to un- derstand the relationship among COMP, WFS, and STABLE. We also discuss some implementation issues of CWFS.
KW - Clark’s completion
KW - Knowledge representation
KW - Logic programming
KW - Non-monotonic reasoning
KW - Normal programs
KW - Stable semantics
KW - Well Founded semantics
UR - https://www.scopus.com/pages/publications/84948976896
U2 - 10.1007/3-540-49795-1_20
DO - 10.1007/3-540-49795-1_20
M3 - Conference contribution
AN - SCOPUS:84948976896
SN - 3540649921
SN - 9783540649922
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 230
EP - 241
BT - Progress in Artificial Intelligence - IBERAMIA 1998 - 6th Ibero-American Conference on AI, Proceedings
A2 - Coelho, Helder
PB - Springer Verlag
T2 - 6th Ibero-American Congress on Artificial Intelligence, IBERAMIA 1998
Y2 - 5 October 1998 through 9 October 1998
ER -