What was covered so far was how the user populates the constraint store. The other direction of the information flow consists of the success and failure of the above predicates and the binding of variables to numerical values. Example:

clp(r) ?-{A-B+C=10, C=5+5}.{A = B}, C = 10.0

The linear constraints imply `C=10.0`

and the solver consequently
exports this binding to the Prolog world. The fact that
`A=B`

is deduced and represented by the solver but not
exported as a binding. More about answer presentation in
CLPQR Projection.

Send feedback on this subject.