A Rewriting Method for Well-Founded Semantics with Explicit Negation

Authors:
Pedro Cabalar
Affiliations:
-
Venue:
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Year:
2002

Citing 6
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Well founded semantics for logic programs with explicit negation

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
‘Classical’ Negation in Nonmonotonic Reasoning and Logic Programming

Journal of Automated Reasoning
Transformation-based bottom-up computation of the well-founded model

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a modification of Brass et al's transformation-based method for the bottom-up computation of well-founded semantics (WFS), in order to cope with explicit negation, in the sense of Alferes and Pereira's WFSX semantics. This variation consists in the simple addition of two intuitive transformations that guarantee the satisfaction of the so-called coherence principle: whenever an objective literal is founded, its explicit negation must be unfounded. The main contribution is the proof of soundness and completeness of the resulting method with respect to WFSX. Additionally, by a direct inspection on the method, we immediately obtain results that help to clarify the comparison between WFSX and regular WFS when dealing with explicit negation.