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 socalled 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. J. Alferes. Semantics of Logic Programs with Explicit Negation. PhD thesis, Facultade de Ciências e Tecnologia, Universidade Nova de Lisboa, 1993.
J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. ‘classical’ negation in non-monotonic reasoning and logic programming. Journal of Automated Reasoning, 20(1):107–142, 1998.
S. Brass, J. Dix, B. Freitag, and U. Zukowski. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming, to appear, 2001. (Draft version available at http://www.cs.man.ac.uk/~jdix/Papers/01_TPLP.ps.gz ).
P. Cabalar. Pertinence for causal representation of action domains. PhD thesis, Facultade de Informáatica, Universidade da Coruña, 2001.
P. Cabalar, M. Cabarcos, and R. P. Otero. PAL: Pertinence action language. In Proceedings of the 8th Intl. Workshop on Non-Monotonic Reasoning NMR’2000 (Collocated with KR’2000), Breckenridge, Colorado, USA, april 2000. (http://xxx.lanl.gov/abs/cs.AI/0003048).
M. Fitting. A kripke-kleene semantics for logic programs. Journal of Logic Programming, 2(4):295–312, 1985.
M. Gelfond and V. Lifschitz. The stable models semantics for logic programming. In Proc. of the 5th Intl. Conf. on Logic Programming, pages 1070–1080, 1988.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In Proceedings of the European Conference on Artificial Intelligence (ECAI’92), pages 102–106, Montreal, Canada, 1992. John Wiley & Sons.
Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.
M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23:733–742, 1976.
A. van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computing and System Sciences, 47(1):185–221, 1993.
A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabalar, P. (2002). A Rewriting Method for Well-Founded Semantics with Explicit Negation. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-45619-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43930-1
Online ISBN: 978-3-540-45619-3
eBook Packages: Springer Book Archive