Abstract
We propose a new model-theoretic semantics for logic programs, called pure semantics, based on the notions of unfounded set and assumption set. The pure semantics emerges from the observation that major logic programming semantics have the following feature in common: given an ’intended model’ M, the set of negative literals in M corresponds exactly with the greatest unfounded set w.r.t. the set of positive literals in M. In other words, a model contains redundant information as its negative part can be described in function of its positive part. Thus, the total models and the partial models of programs can now be characterized by a set of positive literals. Based on this idea, we develop the pure semantics for logic programs. The result is a remarkably simple semantics that unifies previous approaches and explains how partial model semantics follows from a weaker closed world assumption.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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, “'The Stable Model Semantics for Logic Programming,” in Proc. of the Intl. Conf. on Logic Programming, pp. 1071–1079, 1988.
M. Gelfond and V. Lifschitz, Logic Programs with Classical Negation, 1989. Manuscript
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 D. Sacca, “Extending logic programming,” in Proceedings of the SIGMOD conference, pp. 184–193, 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, A universally consistent semantics for extended logic programs, Submitted for puclication, 1992.
T. Przymusinski, “Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming,” Proc. 1st Int. Conference on Principles of Knowledge Representation and Reasoning, pp. 341–349, 1989.
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 Systems, 1990.
Jia-Huai You and Li Yan Yuan, “Three-Valued Formalization of Logic Programming: Is It Needed?,” in Proc. of the PODS'90 conference, pp. 172–182, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laenens, E., Vermeir, D., Zaniolo, C. (1992). Logic programming semantics made easy. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_99
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive