Representing infinite sequences of resolvents in recursive First-Order Horn Databases
A First Order Database is defined as a function-free First-Order Theory in which the ground units serve as the Extensional Database and the proper non-logical axioms serve as the Intensional Database. This paper addresses the following problem: “Given a recursive non-logical axiom and a theorem to be proved which interacts with this axiom, can we describe a set of finite retrieval requests such that all and only the correct proofs to the theorem are found”. Our solution uses resolution-proof techniques over connection graphs to derive a program of retrieval requests from the Extensional Database that gives all the answers to a query and has a well-defined termination condition.
Unable to display preview. Download preview PDF.
- A. Aho and J. Ullman, “The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing,” Prentice-Hall, Englewood Cliffs, N.J., 1972.Google Scholar
- C. Chang, “On Evaluation of Queries Containing Derived Relations in a Relational Data Base,” Workshop on Formal Basis for Databases, Toulouse, France, 1979.Google Scholar
- L. Henshen, S. Naqvi, “On Compiling Queries in Recursive First-Order Databases”, submitted to JACM.Google Scholar
- R. Reiter, “Deductive Question Answering on Relational Data Bases,” in Logic and Data Bases (ed. H. Gallaire and J. Minker), Plenum Press, 1978.Google Scholar
- R. Reiter, “Equality and Domain Closure for First-Order Data Bases,” Journal of the ACM, Vol. 27, No. 2, 1980.Google Scholar
- J. Robinson, “A Machine-Oriented Logic Based on the Resolution Principle,” Journal of the ACM, Vol. 12, No. 1, 1965.Google Scholar
- S. Shapiro, and D. McKay, “Inference with Recursive Rules,” Proc. NCAI, Stanford University, 1980.Google Scholar
- S. Sickel, “A Search Technique for Clause Interconnectivity Graphs,” IEEE transactions on computers, Vol. C-25, No. 8, 1976.Google Scholar
- J. Ullman, “Principles of Data Base Systems,” Computer Science Press, Potomac, Md., 1980.Google Scholar