The Q∗ algorithm—a search strategy for a deductive question-answering system

摘要

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 described. 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 clouse from one or two other clauses. The inferential component includes many refinements of resolution.