Abstract
Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for finite propositional programs under the well-founded semantics. This algorithm is implemented as a meta-interpreter.
Partially supported by the National Science Foundation grant #IRI-9306751.
Partially supported by the National Science Foundation grant #IRI-9313061.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Roland Bol and Lars Degerstedt. The underlying search for magic templates and tabulation. In Logic Programming: Proceedings of the Tenth Int'l Conf. on Logic Programming, pages 793–811, 1993.
Roland Bol. Loop Checking in Logic Programming. PhD thesis, University of Amsterdam, 1991.
Weidong Chen and David Warren. Query evaluation under the well founded semantics. In The Twelfth ACM Symposium on Principles of Database Systems, 1993.
Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
Robert Kowalski and Fariba Sadri. Logic programs with exceptions. New Generation Computing, 9:387–400, 1991.
Kenneth Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7(3):231–245, 1989.
Vladimir Lifschitz. SLDNF, constructive negation and grounding. In Proc. of ICLP-95, 1995. To appear.
Grigori Mints. A complete calculus for pure Prolog. Proc. Academy of Sciences of Estonian SSR, 35(4):367–380, 1986. In Russian.
Teodor Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, pages 445–464, 1990.
Teodor Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.
Teodor Przymusinski. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence, 12:141–187, 1994.
Allen Van Gelder, Kenneth Ross, and John Schlipf. The well-founded semantics for general logic programs. Journal of ACM, pages 221–230, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lifschitz, V., McCain, N., Przymusinski, T.C., Stärk, R.F. (1995). Loop checking and the well-founded semantics. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59487-1
Online ISBN: 978-3-540-49282-5
eBook Packages: Springer Book Archive