Next: Constructing Data Structures
Up: Adding Computation Domains: CLP
Previous: Herbrand Terms
- The only constraint allowed between Herbrand terms is =/2
- Its meaning is syntactic equality (unification)
- Roughly speaking,
- An equation
is
solved by solving
- An equation ,
where
is a variable and
is a term
which do not contains
is solved with the binding
- Equations like
can be deleted
- If none of the above can be applied, the initial terms cannot
be unified
- Example:
-
- ?- X = f(a, b).
X = f(a, b)
?- X = f(T, a), T = b.
T = b, X = f(b,a)
?- f(X, g(X, Y), Y) = f(a, T, b).
X = a, Y = b, T = g(a, b)
Last modification: Thu Oct 7 12:04:03 MEST 1999 <webmaster@clip.dia.fi.upm.es>