A query evaluation process for a logic data base comprising a set of clauses is described. It is essentially a Horn clause theorem prover augmented with a special inference rule for dealing with negation. This is the negation as failure inference rule whereby ~ P can be inferred if every possible proof of P fails. The chief advantage of the query evaluator described is the effeciency with which it can be implemented. Moreover, we show that the negation as failure rule only allows us to conclude negated facts that could be inferred from the axioms of the completed data base, a data base of relation definitions and equality schemas that we consider is implicitly given by the data base of clauses. We also show that when the clause data base and the queries satisfy certain constraints, which still leaves us with a data base more general than a conventional relational data base, the query evaluation process will find every answer that is a logical consequence of the completed data base.


Data Base Evaluation Tree Selection Rule Inference Rule Query Evaluation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boyer, R.S. and Moore, J.S. [1972] The Sharing of Structure in Theorem Proving Programs. In Machine Intelligence 7 (B. Meltzer and D. Michie, Eds.), Edinburgh University Press, 101–116.Google Scholar
  2. 2.
    Chang, C. L. and Lee, R.C.T. [1973] Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.zbMATHGoogle Scholar
  3. 3.
    Codd, E. F. [1970] A Relational Model for Large Shared Data Banks, CACM 13, 6 (June, 1970), 377–387.zbMATHGoogle Scholar
  4. 4.
    Codd, E. F. [1972] Relational Completeness of Data Base Sublanguages, In Data Base Systems (R. Rustin, Ed.), Prentice-Hall, 65–98.Google Scholar
  5. 5.
    Hewitt, C. [1972] Description and Theoretical Analysis (Using Schemata) of PLANNER: A Language for Proving Theorems and Manipulating Models in a Robot, A. I. Memo No. 251, MIT Project MAC., 1972.Google Scholar
  6. 6.
    Hill, R. [1974] Lush-Resolution and Its Completeness, DCL Memo No. 78, Department of Artificial Intelligence, Edinburgh University, 1974.Google Scholar
  7. 7.
    Knuth, D. [1968] Fundamental Algorithms, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass, 1968.Google Scholar
  8. 8.
    Kowalski, R. and Kuehner, D. [1971] Linear Resolution with Selection Function, Artificial Intelligence 2, 3/4 (1971), 221–260.MathSciNetGoogle Scholar
  9. 9.
    Kowalski, R. [1978] Logic for Data Description, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, N.Y., 77–103.Google Scholar
  10. 10.
    Kramosil, I. [1975] A Note on Deduction Rules with Negative Premises, Proceedings IJCAI 4, Tbilisi, USSR, 1975, 53–56.Google Scholar
  11. 11.
    Nicolas, J. M. and Gallaire, H. [1978] Data Bases: Theory vs. Interpretation, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, N.Y., 1978, 33–54.Google Scholar
  12. 12.
    Reiter, R. [1978] 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
  13. 13.
    Reiter, R. [1977] An Approach to Deductive Question-Answering, BBN Report No. 3649, Bolt, Beranek and Newman, Cambridge, Mass., 1977.Google Scholar
  14. 14.
    Roussel, P. [1975] PROLOG: Manual dutilisation, Rapport Interne, G.I.A., UER de LUMINY, Universite d’Aix-Marseille, 1975.Google Scholar
  15. 15.
    van Emden, M. [1978] Computation and Deductive Information Retrieval, In Formal Description of Programming Concepts, (E. Neuhold, Ed.), North-Holland, 1978.Google Scholar
  16. 16.
    Warren, D., Pereira, L. and Pereira, F. [1977] PROLOG — The Language and Its Implementation Compared with LISP, Proceedings of SIGART/SIGPLAN Conference on Programming Languages, Rochester, New York, 1977.Google Scholar

Copyright information

© Plenum Press, New York 1978

Authors and Affiliations

  • Keith L. Clark
    • 1
  1. 1.Department of Computer Science & StatisticsQueen Mary CollegeLondonEngland

Personalised recommendations