Negations and quantifiers in NU-Prolog
Proceedings on Third international conference on logic programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Generalized well-founded semantics for logic programs
CADE-10 Proceedings of the tenth international conference on Automated deduction
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Implementing stable semantics by linear programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
The Go¨del programming language
The Go¨del programming language
Partial Order Programming (Revisited)
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Characterizations of the Stable Semantics by Partial Evaluation
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Improving the Alternating Fixpoint: The Transformation Approach
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Programs with Universally Quantified Embedded Implications
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Aggregation and Well-Founded Semantics
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Transformation-Based Bottom-Up Computation of the Well-Founded Model
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
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 understand the relationship among COMP, WFS, and STABLE. We also discuss some implementation issues of CWFS.