Transforming Deterministic REL Predicates into LL Functions

After loading REL programs with consult at the emulator toplevel, or asserting REL clauses (and mode declarations) with az , the following commands have to be used to detect and transform deterministic predicates and to compile the remaining (non-deterministic) predicates:

1. undeclare ``executes'' the declare facts and thus the mode declarations
2. deta transforms deterministic predicates into LL functions and compiles them
3. compile compiles the remaining (non-deterministic) predicates

These steps also are illustrated in appendix C.