The Application of Theorem Proving to Question-Answering Systems

This paper shows how a question-answering system can use first-order logic as its language and an automatic theorem prover , based upon the resolution inference principle , as its deductive mechanism. The resolut ion proof procedure is extended to a construct i ve proof procedure. An answer construction algorithm is given whereby the system is able not only to produce yes or no answers but also to find or construct an object satisfying a specified condition. A working computer program , QA3 , based on these ideas , is described. The performance of the program , illustrated by extended examples , compares favorably with several other questionanswering programs. Methods are presented for solving state transformation problems. In addition to question answering, the program can do automatic programming (simple program writing, program verifying, and debugging) 1 control and problem solving for a simple robot , pattern recognition (scene description), and puzzles.