Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
Chang, C. L. and Lee, R.C.T. [1973] Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
Codd, E. F. [1970] A Relational Model for Large Shared Data Banks, CACM 13, 6 (June, 1970), 377–387.
Codd, E. F. [1972] Relational Completeness of Data Base Sublanguages, In Data Base Systems (R. Rustin, Ed.), Prentice-Hall, 65–98.
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.
Hill, R. [1974] Lush-Resolution and Its Completeness, DCL Memo No. 78, Department of Artificial Intelligence, Edinburgh University, 1974.
Knuth, D. [1968] Fundamental Algorithms, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass, 1968.
Kowalski, R. and Kuehner, D. [1971] Linear Resolution with Selection Function, Artificial Intelligence 2, 3/4 (1971), 221–260.
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.
Kramosil, I. [1975] A Note on Deduction Rules with Negative Premises, Proceedings IJCAI 4, Tbilisi, USSR, 1975, 53–56.
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.
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.
Reiter, R. [1977] An Approach to Deductive Question-Answering, BBN Report No. 3649, Bolt, Beranek and Newman, Cambridge, Mass., 1977.
Roussel, P. [1975] PROLOG: Manual dutilisation, Rapport Interne, G.I.A., UER de LUMINY, Universite d’Aix-Marseille, 1975.
van Emden, M. [1978] Computation and Deductive Information Retrieval, In Formal Description of Programming Concepts, (E. Neuhold, Ed.), North-Holland, 1978.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Plenum Press, New York
About this chapter
Cite this chapter
Clark, K.L. (1978). Negation as Failure. In: Gallaire, H., Minker, J. (eds) Logic and Data Bases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3384-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4684-3384-5_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-3386-9
Online ISBN: 978-1-4684-3384-5
eBook Packages: Springer Book Archive