Abstract
An extended logic program (ELP) is a logic program that allows for classical negation as well as for negation-as-failure. Previous proposals for ELP semantics can be divided into two classes. The first class avoids contradictions by means of an unnatural discrimination between positive literals and negative literals. In the second class, positive and negative literals have the same status, but contradictions may occur and therefor these semantics are not universally consistent (some programs have no consistent models). As both classes have their own specific shortcomings, we propose a new model-theoretic semantics for ELPs, called the pure semantics, based on the notions of unfounded set and assumption set. The pure semantics for ELPs resolves all contradictions while preserving the same status for positive and negative literals, thus overcoming the imperfections of previous semantics. This paper uses and extends the results obtained inLae92a where a simplification and unification of the semantics for general logic programs (i.e. ELPs that don't contain classical negation) was proposed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Gabbay, E. Laenens, and D. Vermeir, “Credulous vs. Sceptical Semantics for Ordered Logic Programs,” in Proceedings of the International Conference on Knowledge Representation (KR91), pp. 208–217, Morgan Kaufmann, 1991.
A. Van Gelder, K. Ross, and J. S. Schlipf, The Well-Founded Semantics for General Logic Programs, 1988. UCSC-CRL-88-16
M. Gelfond and V. Lifschitz, “Logic Programs with Classical Negation,” 7th International Logic Programming Conference, 1989.
R. Kowalski and F. Sadri, “Logic programs with exceptions,” in Proc. of the 7th International Logic Programming Conference, pp. 579–597, MIT Press, 1990.
E. Laenens, D. Vermeir, and D. Sacca, “Extending logic programming,” in Proceedings of the SIGMOD conference, pp. 184–193, 1990.
E. Laenens and D. Vermeir, “A Fixpoint Semantics of Ordered Logic,” Journal of Logic and Computation, vol. 1, no. 2, pp. 159–185, 1990.
E. Laenens, “Foundations of Ordered Logic,” PhD Thesis, University of Antwerp (UIA), 1990.
E. Laenens, D. Vermeir, and C. Zaniolo, “Pure models for logic programs: a simplification and unification of logic programming semantics,” Technical report, 91-31, 1991.
E. Laenens, D. Vermeir, and C. Zaniolo, “Logic programming semantics made easy,” Proceedings of the ICALP'92 conference, pp. 499–508, 1992.
E. Laenens and D. Vermeir, “Assumption-free Semantics for Ordered Programs: On the Relationship between Well-Founded and Stable Partial Models,” Journal of Logic and Computation, vol. 2, no. 2, pp. 133–172, 1992.
J. W. Lloyd, Foundations of Logic Programming, Springer Verlag, 1987.
T. Przymusinski, “Well-founded semantics coincides with three-valued stable semantics,” Fundamenta Informaticae, vol. 13, pp. 445–463, IOS Press, 1990.
D. Sacca and C. Zaniolo, “Stable models and Non-determinism for logic programs with negation,” Proc. ACM Symp. on Principles of Database System, 1990.
A. Tarski, “A Lattice Theoretical Fixpoint Theorem and its Application,” Pacific Journal of Mathematics, no. 5, pp. 285–309, 1955.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laenens, E. (1993). On the semantics of negations in logic programming. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028203
Download citation
DOI: https://doi.org/10.1007/BFb0028203
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive