## An Efficient Unification Algorithm (1982)

Venue: | TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS (TOPLAS) |

Citations: | 332 - 1 self |

### BibTeX

@ARTICLE{Martelli82anefficient,

author = {Alberto Martelli and Ugo Montanari},

title = {An Efficient Unification Algorithm},

journal = {TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS (TOPLAS)},

year = {1982},

volume = {4},

number = {2},

pages = {258--282}

}

### Years of Citing Articles

### OpenURL

### Abstract

The unification problem in first-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.