THE APPLICATION OF THEOREM PROVING TO QUESTION-ANSWERING SYSTEMS.

reportActive / Technical Report | Accession Number: AD0696394 | Need Help?

Abstract:

The 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. Methods are presented for solving state transformation problems. In addition to question-answering, the program can do automatic programming, control and problem solving for a simple robot, pattern recognition, and puzzles. Author

Author(s):
Green, Claude Cordell
Author Organization(s):
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Descriptive Note:
Doctoral thesis,
Supplementary Note:
Sponsored in part by Contract SD-183. Report on Stanford Artificial Intelligence Project.
Pagination:
0170

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
CS-138, AI Memo-96
Contract/Grant Number(s):
F30602-69-C-0056, AF 30(602)-4147
Project Number(s):
ARPA Order-457
 Subject Terms
Modernization Areas:
Autonomy
Communities of Interest:
Autonomy
Descriptor(s):
(*ARTIFICIAL INTELLIGENCE, INFORMATION RETRIEVAL), (*LEARNING MACHINES, PROBLEM SOLVING), COMPUTER PROGRAMMING, AUTOMATA, MEMORY DEVICES, COMPUTER LOGIC, PATTERN RECOGNITION, ALGORITHMS, THESES
Field(s)/Group(s):
Computer Programming and Software, Computer Hardware, Bionics
Keyword(s):
QA3 COMPUTER PROGRAM
Report Date:
1969 Jun 01