An Efficient Unification Algorithm
Alberto Martelli, Ugo Montanari · ACM Transactions on Programming Languages and Systems · 1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given.A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nondeterministic one, and a PASCAL implementation is given.A comparison with other well-known unification algorithms shows that the algorithm described here performs well in all cases.
Cited by 776 works. doi:10.1145/357162.357169 Open-access PDF
Authors
References
- The Design and Analysis of Computer Algorithms
- A Machine-Oriented Logic Based on the Resolution Principle
- Computer-Based Medical Consultations: MYCIN.
- Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
- A theory of type polymorphism in programming
- Symbolic Logic and Mechanical Theorem Proving
- A Transformation System for Developing Recursive Programs
- Simple Word Problems in Universal Algebras
- Computational Problems in Abstract Algebra
- Prolog - the language and its implementation compared with Lisp