Advertisement

Deductive Question-Answering on Relational Data Bases

  • Raymond Reiter

Abstract

The principal concern of this paper is the design of a retrieval system which combines current techniques for query evaluation on relational data bases with a deductive component in such a way that the interface between the two is both clean and natural. The result is an approach to deductive retrieval which appears to be feasible for data bases with very large extensions (i.e. specific facts) and comparatively small intensions (i.e. general facts). More specifically, a suitably designed theorem prover “sweeps through” the intensional data base, extracting all information relevant to a given query. This theorem prover never looks at the extensional data base. The end result of this sweep is a set of queries, each of which is extensionally evaluated. The union of answers returned from each of these queries is the set of answers to the original query.

One consequence of this decomposition into an intensional and extensional processor is that the latter may be realized by a conventional data base management system. Another is that the intensional data base can be compiled using a theorem prover as a once-only compiler.

This paper is essentially an impressionistic survey of some results which are rigorously treated elsewhere. As such, no proofs are given for the theorems stated, and the basic system design is illustrated by means of an extended example.

Keywords

Search Tree Theorem Prover Query Evaluation Closed World Assumption Clausal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chang, C.L. [1978] DEDUCE 2: Further Investigations on Deduction in Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, N.Y., 1978, 201–236.Google Scholar
  2. 2.
    Clark, K. [1978] Negation as Failure, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, New York, 1978, 293–322.Google Scholar
  3. 3.
    Codd, E. F. [1972] Relational Completeness of Data Base Sublanguages, In Da ta Base Systems (R. Rustin, Ed.), Prentice-Hall, Englewood Cliffs, N.J., 1972, 65–98.Google Scholar
  4. 4.
    Green, C. C. [1969] Theorem Proving by Resolution as a Basis for Question Answering Systems, In Machine Intelligence, Vol. 4 (B. Meltzer and D. Michie, Eds.), American Elsevier Publishing Co., New York, N.Y., 1969, 183–208.Google Scholar
  5. 5.
    Kellogg, C., Klahr, P. and Travis, L. [1978] Deductive Planning and Pathfinding for Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, N.Y., 1978, 179–200.Google Scholar
  6. 6.
    McSkimin, J. R. [1976] “The Use of Semantic Information in Deductive Question-Answering Systems,” Ph.D. Thesis, Department of Computer Science, University of Maryland, College Park, Maryland, 1976.Google Scholar
  7. 7.
    McSkimin, J. R. and Minker, J. [1977] The Use of a Semantic Network in a Deductive Question-Answering System, Proceedings IJCAI-77, Cambridge, Massachusetts, 1977, 50–58.Google Scholar
  8. 8.
    Minker, J. [1978] An Experimental Relational Data Base System Based on Logic, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, New York, 1978, 107–147.Google Scholar
  9. 9.
    Minker, J., Fishman, D. H., and McSkimin, J. R. [1973] The Q* Algorithm — A Search Strategy for a Deductive Question-Answering System, Artificial Intelligence4, (1973), 225–243.MATHCrossRefGoogle Scholar
  10. 10.
    Palermo, F. P. [1974] A Data Base Search Problem, In Information Systems (J. T. Tou, Ed.), Plenum Press, New York, N.Y., 1974, 67–101.Google Scholar
  11. 11.
    Reiter, R, [1971] Two Results on Ordering for Resolution with Merging and Linear Format, JACM18, 4(0ctober 1971), 630–646.MATHCrossRefGoogle Scholar
  12. 12.
    Reiter, R. [1976] Query Optimization for Question-Answering Systems, Proceedings COLING, Ottawa, Canada, June 28 — July 2, 1976.Google Scholar
  13. 13.
    Reiter, R. [1977] An Approach to Deductive Question-Answering, BBN Tech. Report 3649, Bolt Beranek and Newman, Inc., Cambridge, Mass., Sept. 1977, 161 pp.Google Scholar
  14. 14.
    Reiter, R. [1978a] On Structuring a First Order Data Base, Proceedings of the Canadian Society for Computational Studies of Intelligence, Second National Conference (R. Perrault, Ed.), Toronto, July 19–21, 1978.Google Scholar
  15. 15.
    Reiter, R. [1978b] On Closed World Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, N.Y., 1978, 55–76.Google Scholar
  16. 16.
    Robinson, G. A., and Wos, L. [1969] Paramodulation and Theorem Proving in First Order Theories with Equality, In Machine Intelligence, Vol. 4 (B. Meltzer and D. Michie, Eds.), American Elsevier, New York, N.Y., 1969, 135–150.Google Scholar

Copyright information

© Plenum Press, New York 1978

Authors and Affiliations

  • Raymond Reiter
    • 1
  1. 1.The University of British ColumbiaVancouverUSA

Personalised recommendations