next up previous contents index
Next: Outline of Algorithm Up: Programming in CLP() Previous: rule/2retract/1 and assert/1

Output

     

An important feature of the CLP( tex2html_wrap_inline4020 ) system is its ability to output the collected constraints of a successful derivation in a simpler form. In a typical derivation, thousands of constraints may be collected, and printing them out without simplification would lead to an unusable answer. When a derivation succeeds the output module of CLP( tex2html_wrap_inline4020 ) is invoked to print the constraints relating the variables in the goal. The module can also be invoked using the system predicate dump([X,Y,...,Z]), discussed later.

The CLP( tex2html_wrap_inline4020 ) system attempts to simplify   the constraints in two ways: by projecting the constraints onto a set of target variables   (those appearing in the original goal or given by the user in the argument of dump), and by eliminating redundancy in the constraints. Ideally the output constraints will only involve target variables and be free of redundancy, but this will not always be possible.

Recall that there are constraints of four different forms:

Each of these constraint types is handled differently and in turn.





Alan Borning
Fri Oct 8 12:51:18 PDT 1999