Affiliation:
1. Carnegie-Mellon Univ., Pittsburgh, PA
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference152 articles.
1. AHO V. A. HOPCROFT J. E. AND ULLMAN J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading Mass. AHO V. A. HOPCROFT J. E. AND ULLMAN J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Reading Mass.
2. Resolution in type theory;ANDREWS P. B.;J. Symbolic Logic,1971
3. ANDREWS P. MILLER D. COHEN E. AND PFEN- NING F. 1984. Automating higher-order logic. Vol. 29. In Automated Theorem Proving: After 25 Years W. Bledsoe and D. Loveland Eds. American Mathematical Society Providence R.I. Contemporary Mathematics Series. ANDREWS P. MILLER D. COHEN E. AND PFEN- NING F. 1984. Automating higher-order logic. Vol. 29. In Automated Theorem Proving: After 25 Years W. Bledsoe and D. Loveland Eds. American Mathematical Society Providence R.I. Contemporary Mathematics Series.
4. AIT-KACI H. 1984. A lattice theoretic approach to computation based on a calculus of partially ordered type structures. Ph.D. dissertation. Univ. of Pennsylvania Philadelphia Pa. AIT-KACI H. 1984. A lattice theoretic approach to computation based on a calculus of partially ordered type structures. Ph.D. dissertation. Univ. of Pennsylvania Philadelphia Pa.
Cited by
122 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A (machine-oriented) logic based on pattern matching;Mathematical Structures in Computer Science;2023-07-05
2. Constructionist Approaches;2023-06-22
3. How much Time Does a Logical Inference Take?;On Gödel and the Nonexistence of Time – Gödel und die Nichtexistenz der Zeit;2023
4. Unranked Nominal Unification;Lecture Notes in Computer Science;2022
5. E-Unification based on Generalized Embedding;Mathematical Structures in Computer Science;2021-09