Disjunctive Deductive Databases

Background material is presented on deductive and normal deductive databases. A historical review is presented of work in disjunctive deductive databases, starting from 1982. The semantics of alternative classes of disjunctive databases is reviewed with their model and fixpoint characterizations. Algorithms are developed to compute answers to queries in the alternative theories using the concept of a model tree. Open problems in this area are discussed.

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

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

[3]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases , 1989, DOOD.

[4]  Jorge Lobo,et al.  Generalized Well-founded Semantics for Logic Programs (Extended Abstract) , 1990, CADE.

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

[6]  Vladimir Lifschitz,et al.  Pointwise Circumscription: Preliminary Report , 1986, AAAI.

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

[8]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[9]  LiuKen-Chih,et al.  Indefinite and maybe information in relational databases , 1990 .

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

[11]  Carlo Zaniolo.  Database relations with null values , 1982, PODS '82.

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

[13]  Jack Minker,et al.  Toward A Foundation of Disjunctive Logic Programming , 1989, NACLP.

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

[15]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[16]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

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

[18]  MinkerJack,et al.  Logic and Databases: A Deductive Approach , 1984 .

[19]  Tomasz Imielinski,et al.  Complexity of query processing in databases with OR-objects , 1989, PODS '89.

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

[21]  Jack Minker,et al.  Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases , 1991, ICLP.

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

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

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

[25]  John Grant,et al.  Null Values in a Relational Data Base , 1977, Inf. Process. Lett..

[26]  Lawrence J. Henschen,et al.  Recursive Query Answering with Non-Horn Clauses , 1988, CADE.

[27]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

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

[29]  Jack Minker,et al.  Advances in Data Base Theory: Volume 1 , 1981 .

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

[31]  Jan Chomicki,et al.  Generalized Closed World Assumptions is Pi^0_2-Complete , 1990, Inf. Process. Lett..

[32]  Rajshekhar Sunderraman,et al.  Indefinite and maybe information in relational databases , 1990, TODS.

[33]  Li-Yan Yuan,et al.  A sound and complete query evaluation algorithm for relational databases with disjunctive information , 1989, PODS '89.

[34]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

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

[36]  Raymond Reiter,et al.  A sound and sometimes complete query evaluation algorithm for relational databases with null values , 1986, JACM.

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

[38]  Yannis Vassiliou,et al.  Null values in data base management a denotational semantics approach , 1979, SIGMOD '79.

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

[40]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[41]  Hendrik Decker,et al.  On the Declarative, Operational and Procedural Semantics of Disjunctive Computational Theories , 1991, DAISD.

[42]  Witold Lipski,et al.  On Databases with Incomplete Information , 1981, JACM.

[43]  Carlo Zaniolo,et al.  Database relations with null values , 1982, J. Comput. Syst. Sci..

[44]  Alexander Borgida,et al.  Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning , 1989, KR.

[45]  Jorge Lobo,et al.  WF³: A Semantics for Negation in Normal Disjunctive Logic Programs , 1991, ISMIS.

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

[47]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[48]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[49]  Kenneth A. Ross,et al.  The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.

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

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

[52]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[53]  Joachim Biskup,et al.  A Formal Approach to Null Values in Database Relations , 1979, Advances in Data Base Theory.

[54]  Rajshekhar Sunderraman,et al.  On representing indefinite and maybe information in relational databases: a generalization , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

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

[56]  Joachim Biskup,et al.  A foundation of CODD's relational maybe-operations , 1983, TODS.

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

[58]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.