Control structure of a pattern-directed search system

  • Authors:
  • Jack Minker

  • Affiliations:
  • University of Maryland, College Park, MD

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

A pattern-directed search system based upon work in the first-order predicate calculus and oriented towards Question Answering Systems is described. The pattern directed search consists of a modified form of the unification algorithm which permits a set of literals (which may be thought of as subproblems) to unify only if they can be made to match syntactically and semantically. Although the system can be used as a general theorem prover, the work described is oriented towards Question Answering Systems. Semantic information is obtained from a semantic network embedded in the system and used during the pattern matching process.