A problem-oriented inferential database system

Recently developed inferential database systems face some common problems: a very fast growth of search space and difficulties in recognizing inference termination (especially for recursive axioms). These shortcomings stem mainly from the fact that the inference process is usually separated from database operations. A problem-oriented inferential system i8 described which refers to the database prior to query (or subquery) processing, so that the inference from the very beginning is directed by data relevant to the query. A multiprocessor implementation of the system is presented based on a computer network conforming to database relations and axioms. The system provides an efficient indication of query termination, and is complete in the sense that it produces all correct answers to a 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]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[3]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

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

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

[6]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

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

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

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

[10]  Sakti Pramanik.  Highly parallel associative search and its application to cellular database machine design , 1981, AFIPS '81.

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

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

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

[14]  Roger L. Haskin,et al.  Operational characteristics of a harware-based pattern matcher , 1983, TODS.

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

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

[17]  Dennis de Champeaux,et al.  Bidirectional Heuristic Search Again , 1983, JACM.

[18]  MinkerJack,et al.  State-space problem-reduction, and theorem provingsome relationships , 1975 .

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

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

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

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

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

[24]  David K. Hsiao.  Data Base Computers , 1980, Adv. Comput..

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

[26]  Philip Klahr.  PLANNING TECHNIQUES FOR RULE SELECTION IN DEDUCTIVE QUESTION-ANSWERING , 1978 .

[27]  Jack Minker,et al.  State-space problem-reduction, and theorem proving—some relationships , 1975, Commun. ACM.

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

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

[30]  Daniel H. Fishman.  A Problem-Oriented Search Procedure for Theorem Proving , 1976, IEEE Transactions on Computers.

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

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

[33]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

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

[35]  Yasunori Dohi,et al.  Hardware sorter and its application to data base machine , 1982, ISCA 1982.