In Lifschitz, V. (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 359–380. Academic Press.

Please be advised that ecommerce services will be unavailable for an estimated 6 hours this Saturday 13 November (12:00 – 18:00 GMT).

We have introduced the notion of the closed world assumption for deductive question-answering. This says, in effect, "Every positive statement that you don't know to be true may be assumed false". We have then shown how query evaluation under the closed world assumption reduces to the usual first order proof theoretic approach to query evaluation as applied to atomic queries. Finally, we have shown that consistent Horn data bases remain consistent under the closed world assumption and that definite data bases are consistent with the closed world assumption. ACKNOWLEDGMENT This paper was written with the financial support of the National Research Council of Canada under grant A7642. Much of this research was done while the author was visiting at Bolt, Beranek and Newman, Inc., Cambridge, Mass. I wish to thank Craig Bishop for his careful criticism of an earlier draft of this paper.