| unification The generalisation of that is the equivalent of in . When two s are to be unified, they are compared. If they are both constants then the result of unification is success if they are equal else failure. If one is a variable then it is bound to the other, which may be any term (which satisfies an ""), and the unification succeeds. If both terms are structures then each pair of sub-terms is unified ly and the unification succeeds if all the sub-terms unify. The result of unification is either failure or success with a set of variable bindings, known as a "". There may be many such unifiers for any pair of terms but there will be at most one "", other unifiers simply add extra bindings for sub-terms which are variables in the original terms. (1995-12-14) |
на заглавную 
к началу страницы