Unification: a multidisciplinary survey

  • Authors:
  • Kevin Knight

  • Affiliations:
  • Carnegie-Mellon Univ., Pittsburgh, PA

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

The unification problem and several variants are presented. Various algorithms and data structures are discussed. Research on unification arising in several areas of computer science is surveyed; these areas include theorem proving, logic programming, and natural language processing. Sections of the paper include examples that highlight particular uses of unification and the special problems encountered. Other topics covered are resolution, higher order logic, the occur check, infinite terms, feature structures, equational theories, inheritance, parallel algorithms, generalization, lattices, and other applications of unification. The paper is intended for readers with a general computer science background—no specific knowledge of any of the above topics is assumed.