Constraint logic programming: Difference between revisions

Revision as of 17:53, 11 March 2006

Revision as of 17:55, 11 March 2006

Line 21:

==Terms and constraints==

Different definitions of terms are used, generating different kinds of constraint logic programming: over trees, reals, or finite domains. A kind of constraint that is always present is the equality of terms. Such constraints mustare benecessary present, asbecause the interpreter adds <code>t1=t2</code> to the goal whenever a literal <code>P(...t1...)</code> is replaced with the body of a clause whose rewritten head is <code>P(...t2...)</code>.

===Tree terms===