Information AboutUnification |
| CATEGORIES ABOUT UNIFICATION | |
| automated theorem proving | |
| logic programming | |
For example, with Polynomial s, ''X''2 and ''Y''3 can be unified to ''Z''6 by taking ''X'' = ''Z''3 and ''Y'' = ''Z''2. UNIFICATION IN LOGIC PROGRAMMING The concept of unification is one of the main ideas behind Logic Programming , best known through the language Prolog . It represents the mechanism of binding the contents of variables and can be viewed as a kind of one-time assignment. In Prolog, this operation is denoted by symbol "=". # In traditional Prolog, a Variable ''X'' which is uninstantiated—i.e. no previous unifications were performed on it—can be unified with an atom, a term, or another uninstantiated variable, thus effectively becoming its alias. In many modern Prolog dialects and in First-order Logic , a variable cannot be unified with a term that contains it; this is the so called '' Occurs Check ''. # Two Prolog atoms can only be unified if they are identical. # Similarly, a term can be unified with another term if the top function symbols and Arities of the terms are identical and if the parameters can be unified simultaneously. Note that this is a recursive behaviour. Due to its declarative nature, the order in a sequence of unifications is (usually) unimportant. Note that in the terminology of First-order Logic , an atom is a basic proposition and is unified similarly to a Prolog term. EXAMPLES OF UNIFICATION
REFERENCES
|
|
|