Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution

We propose various generalizations of the usual definition of allowedness used to prove the completeness of SLDNF-resolution. In particular, we define the property of recursively covered programs and goals. We show that, for programs and goals that are call-consistent, even and recursively covered, SLDNF-resolution computes a complete set of ground answers. We then propose further generalized conditions that ensure that SLDNF-resolution is flounder-free. Moreover, this allows us to define a class of programs that subsumes all three major syntactic classes of programs and goals for which SLDNF-resolution is known to be complete; i.e., programs and goals that are either definite, or hierarchical and weakly allowed, or call-consistent, strict and allowed. We conjecture that our generalizations preserve the completeness of SLDNF-resolution. We also investigate the possibility of weakening the other syntactic conditions, i.e., even and call-consistent, while retaining completeness.

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

[2]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[3]  Rodney W. Topor,et al.  Domain-Independent Formulas and Databases , 1987, Theor. Comput. Sci..

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

[5]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[6]  Hendrik Decker.  The Range Form of Databases and Queries or: How to Avoid Floundering , 1989, ÖGAI.

[7]  Chris Mellish,et al.  Abstract Interpretation of Prolog Programs , 1986, ICLP.

[8]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..

[9]  Joxan Jaffar,et al.  Completeness of the Negation as Failure Rule , 1983, IJCAI.

[10]  Zhizhang Shen.  On the completeness of SLDNF-resolution , 1990 .

[11]  Roberto Barbuti,et al.  Completeness of the SLDNF-resolution for a class of logic programs , 1986, ICLP.

[12]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[13]  John C. Shepherdson,et al.  Negation as Failure II , 1985, J. Log. Program..

[14]  John C. Shepherdson,et al.  A Sound and Complete Semantics for a Version of Negation as Failure , 1989, Theor. Comput. Sci..

[15]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[16]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[17]  John W. Lloyd,et al.  A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..

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

[19]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

[20]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

[21]  Bart Demoen,et al.  Abstract Interpretation: Towards the Global Optimization of Prolog Programs , 1987, SLP.

[22]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[23]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[24]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

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

[26]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..