WELL!: An Evaluation Procedure for All Logic Programs

The purpose of this paper is to present Well!, a top-down evaluation procedure for general logic programs. Well! applies to all non floundering logic programs, whether stratifiable, effectively stratifiable or not. Well! extends both SLD-AL resolution and global SLS resolution. Its main feature is its effectiveness (as opposed to global SLS resolution). Well! is sound and (weakly) complete with respect to the well founded semantics. An implementation of Well!, called QSQRWF and derived from QSQR, is outlined.

[1]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[2]  Nicole Bidoit,et al.  Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..

[3]  David B. Kemp,et al.  Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases , 1988, ICLP/SLP.

[4]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[5]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[6]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[7]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[8]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

[9]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[10]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[11]  Melvin Fitting,et al.  Stratified and Three-valued Logic Programming Semantics , 1988, ICLP/SLP.

[12]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[13]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

[14]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[15]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[16]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[17]  François Bry,et al.  Logic programming as constructivism: a formalization and its application to databases , 1989, PODS.

[18]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[19]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[20]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[21]  Kenneth Kunen,et al.  Some Remarks on the Completed Database , 1990, ICLP/SLP.