Unification Algorithm

Home | Terms in Unification | Fist order of unification | Examples in Unification

• Let T1 and T2 be two terms, the following rules are used to determine whether T1 and T2 can be unified:
• If T1 and T2 are both constant terms then they unify only if they are the same term.
• If T1 and T2 are both variables, then they unify. In this case, each becomes an alias for the other: as soon as one is further instantiated to some value, the other variable will have the same value.
• If T1 and T2 are structured terms, then they unify only if:
• they have the same functor, and
• they have the same arity, and
• all of their corresponding arguments can be unified.