Inferring negative information from disjunctive databases

We propose criteria that any rule for inferring negative information from disjunctive databases should satisfy, and examine existing rules from this viewpoint. We then present a new inference rule, the ‘disjunctive database rule’ (DDR), and compare it to the existing rules with respect to the criteria. In particular, the DDR is equivalent to the CWA for definite databases, it infers no more negative information than the GCWA, and it interprets disjunction inclusively rather than exclusively. We generalize the DDR to a class of layered databases, describe an implementation of the DDR, ‘negation as positive failure’, and study its soundness and completeness properties.

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

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

[3]  Teodor C. Przymusinski.  On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.

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

[5]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

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

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

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

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

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

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

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[14]  Donald W. Loveland,et al.  Deleting Repeated Goals in the Problem Reduction Format , 1981, JACM.

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

[16]  Lawrence J. Henschen,et al.  Compiling the GCWA in Indefinite Deductive Databases , 1988, Foundations of Deductive Databases and Logic Programming..

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

[18]  Lawrence J. Henschen,et al.  Deduction in non-Horn databases , 1985, Journal of Automated Reasoning.

[19]  Randy Goebel,et al.  On eliminating loops in Prolog , 1985, SIGP.

[20]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

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

[22]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[23]  Teodor C. Przymusinski,et al.  The extended closed world assumption and its relationship to parallel circumscription , 1985, PODS '86.

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