Negation as failure using tight derivations for general logic programs

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

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

[3]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[4]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[5]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[6]  Stuart C. Shapiro,et al.  Using Active Connection Graphs for Reasoning with Recursive Rules , 1981, IJCAI.

[7]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

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

[9]  Lawrence J. Henschen,et al.  On compiling queries in recursive first-order databases , 1984, JACM.

[10]  John W. Lloyd,et al.  A Logical Reconstruction of Prolog II , 1984, J. Log. Program..

[11]  Adrian Walker,et al.  Some Practical Properties of Logic Programming Interpreters , 1984, FGCS.

[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]  D. McDermott,et al.  Temporal Reasoning and Default Logics. , 1985 .

[15]  Van Tu Le.  General Failure of Logic Programs , 1985, J. Log. Program..

[16]  Eliezer L. Lozinskii,et al.  Evaluating Queries in Deductive Databases by Generating , 1985, IJCAI.

[17]  Van Tu Le.  Negation-As-Failure Rule for General Logic Programs With Equality , 1985, J. Log. Program..

[18]  Michael J. Maher,et al.  Comments on "General Failure of Logic Programs" , 1986, J. Log. Program..

[19]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

[20]  Drew McDermott,et al.  Default Reasoning, Nonmonotonic Logics, and the Frame Problem , 1986, AAAI.

[21]  Kim Marriott,et al.  Explicit Representation of Terms Defined by Counter Examples , 1986, FSTTCS.

[22]  Jeffrey D. Ullman,et al.  Design Overview of the NAIL! System , 1986, ICLP.

[23]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

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

[25]  Allen Van Gelder,et al.  A message passing framework for logical query evaluation , 1986, SIGMOD '86.

[26]  Rodney W. Topor,et al.  Safety and correct translation of relational calculus formulas , 1987, PODS '87.

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

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

[29]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[30]  Liz Sonenberg,et al.  On Domain Independent Databases , 1988, Foundations of Deductive Databases and Logic Programming..

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

[32]  Jeffrey D. Ullman,et al.  Efficient tests for top-down termination of logical rules , 1988, JACM.

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

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

[35]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..