The Application of Theorem Proving to Question-Answering Systems
by Green, C.
Technical Note 8
Institution: AI Center, SRI International"
Address: 333 Ravenswood Ave, Menlo Park, CA 94025
Jun 1969.
Note: Project 7494. Stanford PhD Dissertation
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 resolution proof procedure is extended to a constructive 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 question-answering 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), control and problem solving for a simple robot, pattern recognition (scene description), and puzzles.
![]() Adobe PDF |
![]() BibTeX |
![]() EndNote |
Research on Intelligent AutomataA continuation of the original Shakey robot project, investigating AI problems involved in developing a robot. |
| Name | Title | ||
|---|---|---|---|
| Green, Cordell | Alumnus |
