Theorem-proving by resolution as a basis for question answering systems

This paper shows how a question-answering system can be constructed usingfirst-order logic as its language and a resolution-type theorem-prover as itsdeductive mechanism. A working computer-program, Q A3, based on theseideas is described. The performance of the program compares favorably withseveral other general question-answering systems.Reprinted in B. L. Webber and N. J. Nilsson (eds.), Readings in Artificial Intelligence, pp, 202-222, San Francisco: Morgan Kaufmann, 1981 Machine Intelligence 4, pp. 183-205 Meltzer, B. and Michie, D.(eds.). Edinburgh: Edinburgh University Press.