most general unifier


Also found in: Acronyms.

most general unifier

(logic)
If U is the most general unifier of a set of expressions then any other unifier, V, can be expressed as V = UW, where W is another substitution.

See also unification.
Mentioned in ?
References in periodicals archive ?
Since [Pi] [is less than or equal to] [Sigma](t), there exists a most general unifier [Tau] of [Pi] and [Sigma](t) with [Tau] [is less than or equal to] [Sigma][Var(t)] (we assume that [Pi] and t are variable disjoint, otherwise take a new variant of the definitional tree), [[Tau].
2] [element of] T(C, H), we compute the most general unifier of [t.
The computation of the most general unifier in the final step of a narrowing derivation is also done in other narrowing strategies for terminating rewrite systems (e.

Full browser ?