Calculates the complete set of most general unifiers of the terms term1 and term2.
Calculates the complete set of most general unifiers of the terms term1 and term2.
one of the terms to unify. formulas are also allowed, so we accept FOL expressions
one of the terms to unify. formulas are also allowed, so we accept FOL expressions
a list of mgus, the empty list means that term1 and term2 are not unifiable.
The interface for an unification algorithm of finitary type, i.e. one where the complete set of most general unifiers is finite.