Loop checking and the well-founded semantics

  • Vladimir Lifschitz
  • Norman McCain
  • Teodor C. Przymusinski
  • Robert F. Stärk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 928)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bol and Degerstedt, 1993]
    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.Google Scholar
  2. [Bol, 1991]
    Roland Bol. Loop Checking in Logic Programming. PhD thesis, University of Amsterdam, 1991.Google Scholar
  3. [Chen and Warren, 1993]
    Weidong Chen and David Warren. Query evaluation under the well founded semantics. In The Twelfth ACM Symposium on Principles of Database Systems, 1993.Google Scholar
  4. [Clark, 1978]
    Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.Google Scholar
  5. [Gelfond and Lifschitz, 1991]
    Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.Google Scholar
  6. [Kowalski and Sadri, 1991]
    Robert Kowalski and Fariba Sadri. Logic programs with exceptions. New Generation Computing, 9:387–400, 1991.Google Scholar
  7. [Kunen, 1989]
    Kenneth Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7(3):231–245, 1989.Google Scholar
  8. [Lifschitz, 1995]
    Vladimir Lifschitz. SLDNF, constructive negation and grounding. In Proc. of ICLP-95, 1995. To appear.Google Scholar
  9. [Mints, 1986]
    Grigori Mints. A complete calculus for pure Prolog. Proc. Academy of Sciences of Estonian SSR, 35(4):367–380, 1986. In Russian.Google Scholar
  10. [Przymusinski, 1990]
    Teodor Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, pages 445–464, 1990.Google Scholar
  11. [Przymusinski, 1991]
    Teodor Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.Google Scholar
  12. [Przymusinski, 1994]
    Teodor Przymusinski. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence, 12:141–187, 1994.Google Scholar
  13. [Van Gelder et al., 1990]
    Allen Van Gelder, Kenneth Ross, and John Schlipf. The well-founded semantics for general logic programs. Journal of ACM, pages 221–230, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Vladimir Lifschitz
    • 1
  • Norman McCain
    • 1
  • Teodor C. Przymusinski
    • 2
  • Robert F. Stärk
    • 3
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA
  2. 2.Department of Computer ScienceUniversity of California at RiversideRiversideUSA
  3. 3.Department of MathematicsStanford UniversityStanfordUSA

Personalised recommendations