Users Guide To QA3.5 Question-Answering System
by Garvey, Thomas D., and Kling, Robert E.
Technical Note 15
Institution: AI Center, SRI International
Address: 333 Ravenswood Ave, Menlo Park, CA 94025
Note: This research was sponsored by the Advanced Research Projects Agency and the Rome Air Development Center under Contract F30602-69-C-0056. Previously published as Appendix A of Final Report on Contract F30602-69-C-0056, "Application of Intelligent 7, Automata to Reconnaissance", November 1969.
QA3.5 is a question-answering system based on a first-order predicate calculus theorem prover using Robinsons resolution principle. The system is made up of about 240 LISP (written in BBN LISP on the SDS 940) functions, most of which run under QAS, the executive function. The executive contains provisions for changing the strategies, tracing proofs, unwinding proofs (i.e., printing out only those steps that lead directly to a proof, stepping through proofs by hand, and many different operations on the axiom base. The program has proved theorems in group theory, number theory, geometry, and algebra; it has solved "real-time" robot problems; it has been used to draw inferences from data bases containing several hundred axioms.
|Garvey, Thomas D||Associate Director|
|Kling, Robert E||Alumnus|