unifiable's Usage Examples:

All of the Webding glyphs that are not unifiable with existing Unicode characters were added to the Unicode Standard when.

[1] unifiable glyph variants Cook, Richard (6 October 2003).

"unifiable glyph variants" (PDF).

"Two CJK unified ideographs with identical semantics and unifiable shapes," where "unifiable" is taken in the sense of Han unification.

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

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

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

retrieval conditions frequently used in provers: term q {\displaystyle q} is unifiable with term t {\displaystyle t} , i.

{\displaystyle p(X,f(X))} and p ( g ( Y ) , Y ) {\displaystyle p(g(Y),Y)} are unifiable without occurs check, producing the refuting empty clause.

generally, E {\displaystyle E} and F {\displaystyle F} need to have only two unifiable subformulas p 1 {\displaystyle p_{1}} and p 2 {\displaystyle p_{2}} ,.

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

devotion to a cause bigger than themselves, and as these loyalties become unifiable in the higher purposes of groups of persons over many generations, humanity.

predicate logic, Murray's rule is generalized to allow distinct, but unifiable, subformulas p 1 {\displaystyle p_{1}} and p 2 {\displaystyle p_{2}} of.

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

in common with a term s, and the subterm s|p is not a variable and is unifiable with l via the mgu σ, then s can be narrowed to the term t = sσ[rσ]p,.

P ( x 1 ) {\displaystyle P(x_{1})} ; the negation of this literal is unifiable with ¬ P ( a ) {\displaystyle \neg P(a)} , the most general unifier being.