Negation in Rule-Based Database Languages: A Survey

Abstract This paper surveys and compares different techniques investigated in order to integrate negation in rule-based query languages. In the context of deductive databases, a rule-based query is a logic program. The survey focuses on the problem of defining the declarative semantics of logic programs with negation. The declarative semantics of logic programs with negation based on fixpoint techniques, based on three valued logic and based on non-monotonic logics are presented for positive logic programs, (locally) stratifiable logic programs and unstratifiable logic programs. The expressive power of rule-based query languages is examined.

[1]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[2]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[4]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[5]  François Banciihon.  Object-oriented database systems , 1988, PODS 1988.

[6]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[7]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

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

[9]  Christine Froidevaux,et al.  More on Stratified Default Theories , 1988, European Conference on Artificial Intelligence.

[10]  Jay Banerjee,et al.  Data model issues for object-oriented applications , 1987, TOIS.

[11]  Vladimir Lifschitz,et al.  Closed-World Databases and Circumscription , 1987, Artif. Intell..

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

[13]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

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

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

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

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

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

[22]  François Bancilhon,et al.  On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[23]  Patrick C. Fischer,et al.  Some classes of multilevel relational structures , 1985, PODS '86.

[24]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[25]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[26]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[27]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[28]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[29]  Carlo Zaniolo,et al.  On the implementation of a simple class of logic queries for databases , 1985, PODS.

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

[31]  Yuri Gurevich,et al.  Monotone versus positive , 1987, JACM.

[32]  Serge Abiteboul,et al.  COL: A Logic-Based Language for Complex Objects , 1988, EDBT.

[33]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

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

[35]  E. Börger.  Computation Theory and Logic , 1987, Lecture Notes in Computer Science.

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

[37]  Gabriel M. Kuper,et al.  Logic programming with sets , 1987, J. Comput. Syst. Sci..

[38]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[39]  Michael J. Maher,et al.  Closures and Fairness in the Semantics of Programming Logic , 1984, Theor. Comput. Sci..

[40]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[41]  Catriel Beeri,et al.  Sets and negation in a logic data base language (LDL1) , 1987, PODS.

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

[43]  Elias Dahlhaus,et al.  Skolem Normal Forms Concerning the Least Fixpoint , 1987, Computation Theory and Logic.

[44]  Serge Abiteboul,et al.  Non First Normal Form Relations: An Algebra Allowing Data Restructuring , 1986, J. Comput. Syst. Sci..

[45]  John W. Lloyd,et al.  A Basis for Deductive Database Systems II , 1986, J. Log. Program..

[46]  Richard Hull,et al.  Minimalism, Justification and Non-Monotonicity in Deductive Databases , 1989, J. Comput. Syst. Sci..

[47]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[48]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

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

[50]  Michael J. Maher,et al.  Optimal Fixedpoints of Logic Programs , 1985, Theor. Comput. Sci..

[51]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[52]  Michael J. Maher,et al.  Invited Talk: Some Issues and Trends in the Semantics of Logic Programming , 1986, ICLP.

[53]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

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

[55]  Jack Minker,et al.  Perspectives in Deductive Databases , 1988, J. Log. Program..

[56]  Gérard Ferrand,et al.  A methodological view of logic programming with negation , 1989 .

[57]  Roger King,et al.  Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[58]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[59]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[60]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[61]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

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

[63]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[64]  Laurent Vieille,et al.  A Database-Complete Proof Procedure Based on SLD-Resolution , 1987, ICLP.

[65]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

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

[67]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[68]  Taisuke Sato.  Negation and Semantics of Prolog Programs , 1982, ICLP.

[69]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[70]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[71]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

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

[73]  Liz Sonenberg,et al.  Fixed Point Theorems and Semantics: A Folk Tale , 1982, Inf. Process. Lett..

[74]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[75]  Abraham Silberschatz,et al.  Extended algebra and calculus for nested relational databases , 1988, TODS.

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

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

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

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

[80]  Giorgio Levi,et al.  A New Declarative Semantics for Logic Languages , 1988, ICLP/SLP.

[81]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[82]  Jorge Lobo,et al.  Weak Completion Theory for Non-Horn Programs , 1988, ICLP/SLP.

[83]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[84]  Pierre Siegel,et al.  Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..

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

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

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