Tabulated Resolution for the Well-Founded Semantics

This work is motivated by the need for efficient question-answering methods for Horn clause logic and its non-classical extensions - formalisms which are of great importance for the purpose of know ...

[1]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

[2]  Ulf Nilsson,et al.  Magic Computation for Wll-founded Semantics , 1994, NMELP.

[3]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[4]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[5]  Divesh Srivastava,et al.  Query Restricted Bottom-Up Evaluation of Normal Logic Programs , 1992, JICSLP.

[6]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[7]  Ulf Nilsson,et al.  Goal-directed Bottom-up Evaluation of Normal Logic Programs , 1993, ILPS.

[8]  Hirohisa Seki,et al.  On the power of Alexander templates , 1989, PODS.

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

[10]  David S. Warren.  The Underlying Search for Magic Templates and Tabulation , 1993 .

[11]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[12]  Suzanne W. Dietrich,et al.  Extension Tables: Memo Relations in Logic Programming , 1987, SLP.

[13]  Hidenori Itoh,et al.  A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.

[14]  José Júlio Alferes,et al.  Derivation Procedures for Extended Stable Models , 1991, IJCAI.

[15]  Teodor C. Przymusinski,et al.  Soundness and Completeness of Partial Deductions for Well-Founded Semantics , 1992, LPAR.

[16]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[17]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[18]  Robert A. Kowalski,et al.  Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes) , 1988, ICLP/SPL.

[19]  Henryk Jan Komorowski,et al.  A specification of an abstract Prolog machine and its application to partial evaluation , 1981 .

[20]  François Bry,et al.  Query Evaluation in Recursive Databases , 1990 .

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

[22]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[23]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

[24]  Roland N. Bol,et al.  Loop Checking and Negation , 1990, J. Log. Program..

[25]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[26]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[27]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.

[28]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[29]  Jan Komorowski,et al.  A Prolegomenon to Partial Deduction , 1993, Fundamenta Informaticae.

[30]  John W. Lloyd,et al.  Partial Evaluation in Logic Programming , 1991, J. Log. Program..

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

[32]  Ulf Nilsson,et al.  A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics , 1991, Inf. Process. Lett..

[33]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[34]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[35]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[36]  Teodor C. Przymusinski.  On Constructive Negation in Logic Programming , 1989, NACLP.

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

[38]  Krzysztof R. Apt,et al.  Introduction to Logic Programming , 1988 .

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