Evaluating Queries in Deductive Databases by Generating

A strong advantage of bottom up generating techniques is their ability to guarantee finiteness of all inferences in a deductive database system involving recursive axioms. But a "brute force" generating answers to a query would be very inefficient producing many facts useless for the query evaluation. An economy generating method is presented based on discovering explicit facts relevant to the query, and applying preselected axioms as generating rules. The method is proved to be complete in the sense that it generates all the existing answers to the query in a finite time.

[1]  Chin-Liang Chang.  DEDUCE 2: Further Investigations of Deduction in Relational Data Bases , 1977, Logic and Data Bases.

[2]  Chin-Liang Chang.  On Evaluation of Queries Containing Derived Relations in a Relational Data Base , 1979, Advances in Data Base Theory.

[3]  Stuart C. Shapiro,et al.  Inference with Recursive Rules , 1980, AAAI.

[4]  Charles Kellogg,et al.  Deductive Planning and Pathfinding for Relational Data Bases , 1977, Logic and Data Bases.

[5]  Jack Minker.  Performing inferences over relation data bases , 1975, SIGMOD '75.

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

[7]  Jack Minker.  An Experimental Relational Data Base System Based on Logic , 1977, Logic and Data Bases.

[8]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[9]  Jack Minker,et al.  Search strategy and selection function for an inferential relational system , 1978, TODS.

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

[11]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[12]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Jack Minker,et al.  An Overview and Introduction to Logic and Data Bases , 1977, Logic and Data Bases.

[15]  Jack Minker,et al.  On recursive axioms in deductive databases , 1983, Inf. Syst..

[16]  Alfred Horn,et al.  On sentences which are true of direct unions of algebras , 1951, Journal of Symbolic Logic.

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

[18]  Jean-Marie Nicolas,et al.  Integrity Checking in Deductive Data Bases , 1977, Logic and Data Bases.

[19]  Jean-Marie Nicolas,et al.  Data Base: Theory vs. Interpretation , 1977, Logic and Data Bases.

[20]  Lawrence J. Henschen,et al.  Performing Inferences over Recursive Data Bases , 1980, AAAI.

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

[22]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.