Two terms are said to be unifiable if their meet differs from Ω.

Enter two predicates, then press the button to see whether they are Unifiable.

The set of terms unifiable with a given term need not be closed w.r.t. meet; pic.2 shows a counter-example.

Thus it can be bound more than once to unifiable values (but cannot be set back to an empty or unresolved state).

Contraction, where two equal (or unifiable) members on the same side of a sequent may be replaced by a single member (or common instance).

Finding clauses that are unifiable with a term in a query is linear in the number of clauses.

That is, if two nominal terms are unifiable, then their translated pattern counterparts are also unifiable.

Corporate decision making needs to be more metrics-driven, and InstaVistaâ„¢ allows for unifiable actions associated with core business models," stated Roger Haddad.

That is, if two nominal terms are unifiable by some substitution, then the corresponding higher-order pattern unification problem under the translation is solved by the translated substitution.

All of the Webding glyphs that are not unifiable with existing Unicode characters were added to the Unicode Standard when version 7.0 was released in June 2014.

The glossary at Unicode.org[2] defines "Z-variant" as "Two CJK unified ideographs with identical semantics and unifiable shapes," where "unifiable" is taken in the sense of Han unification.

As an example, can be proved unsatisfiable by first generating ; the negation of this literal is unifiable with , the most general unifier being the substitution that replaces with ; applying this substitution results in replacing with , which closes the tableau.