A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Experiments in automatic learning for a multipurpose hueristic program
Communications of the ACM
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
From PLANNER to CONNIVER: a genetic approach
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Resolution, Refinements, and Search Strategies: A Comparative Study
IEEE Transactions on Computers
A Problem-Oriented Search Procedure for Theorem Proving
IEEE Transactions on Computers
| Hi-index | 0.02 |
An approach for bringing semantic, as well as syntactic, information to bear on the problem of theorem-proving search for Question-Answering (QA) Systems is descrilsed. The approach is embodied in a search algorithm, the Q* search algorithm, developed to control deductive searches in an experimental system. The Q* algorithm is part of a system, termed the Maryland Refutation Proof Procedure System (MRPPS), which incorporates both the Q* algorithm, which performs the search required to answer a query, and an inferential component, which performs the logical manipulations necessary to deduce a clause from one or two other clauses. The inferential component includes many refinements of resolution. The Q* algorithm generates nodes in the search space, applying semantic and syntactic information to direct the search. The use of semantics permits paths to be terminated and fruitful paths to be explored. The paper is restricted to a description of the use of syntactic and semantic information in the Q* algorithm.