Coping with Indefinite and Negative Data in Deductive Databases: A Survey

Abstract A problem with current database systems is the limitation placed on the type of data which may be represented and manipulated within such systems. In an attempt to broaden this to a wider class of data (i.e. rules as well as facts) and a more powerful set of manipulations, the concept of a deductive database was introduced. However, for the sake of efficiency the type of rule which is allowed in a deductive database is restricted in form. This paper surveys a number of attempts to move towards less restrictive forms of rules in deductive databases which allow indefinite and negative data to be handled.

[1]  M. Howard Williams,et al.  A Path Finding Method for Constraint Checking in Deductive Databases , 1989, Data Knowl. Eng..

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

[3]  Richard A. Frost,et al.  Introduction to Knowledge Base Systems , 1986 .

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

[5]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[6]  Donald W. Loveland,et al.  Near-Horn PROLOG , 1987, ICLP.

[7]  Shamim A. Naqvi.  Some Extensions to the Closed World Assumption in Databases , 1986, ICDT.

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

[9]  Wolfgang Bibel,et al.  Improvements of a Tautology-Testing Algorithm , 1982, CADE.

[10]  Raymond Reiter,et al.  Circumscription Implies Predicate Completion (Sometimes) , 1982, AAAI.

[11]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[12]  Jorge Lobo,et al.  Skeptical Reasoning and Disjunctive Programs , 1989, KR.

[13]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[14]  Pierre Siegel,et al.  Nonmonotonic Reasoning and Databases , 1982, Advances in Data Base Theory.

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

[16]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[17]  Robert E. Mercer,et al.  On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

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

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

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

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

[22]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

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

[24]  Raymond Reiter,et al.  Deductive Question-Answering on Relational Data Bases , 1977, Logic and Data Bases.

[25]  Michael Gelfond,et al.  Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

[26]  John McCarthy,et al.  Addendum: Circumscription and other Non-Monotonic Formalisms , 1980, Artif. Intell..

[27]  Donald Perlis,et al.  Computing Protected Circumscription , 1985, J. Log. Program..

[28]  Dov M. Gabbay,et al.  N-Prolog: An Extension of Prolog with Hypothetical Implications I , 1984, J. Log. Program..

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

[30]  J. Minker,et al.  Semantics for disjunctive logic programs , 1989 .

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

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

[33]  Donald Perlis,et al.  Applications of Protected Circumscription , 1984, CADE.

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

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

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

[37]  Toshiro Wakayama.  Monadic Cases: Rediscovering Input Resolution , 1989, NACLP.

[38]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[39]  Vladimir Lifschitz,et al.  On the Satisfiability of Circumscription , 1986, Artif. Intell..

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

[41]  D. Gabbay,et al.  Negation as inconsistency .I , 1986 .

[42]  Moshe Y. Vardi.  Querying logical databases , 1985, J. Comput. Syst. Sci..

[43]  John Grant,et al.  Answering Queries in Indefinite Databases and the Null Value Problem , 1986, Adv. Comput. Res..

[44]  Elmar Eder.  Properties of Substitutions and Unifications , 1983, GWAI.