When the deductive component stops we have to update the control component working memory so it has an up-to-date representation of the state of the deductive component. The reification procedure adds meta-predicate instances. These instances will cause that the adequate meta-rules activate. In Figure 10 you can see which is the syntax of general meta-predicates in Milord II.
Figure 10: Syntax of general meta-predicates definition.
The part of the module state that does not change during execution is reified only the first time the reification procedure is called. We call this reification part static. The dynamic reification corresponds to that part of the state that changes during execution. Static and dynamic reification generate instances of predefined meta-predicates (see Figure 11).
Figure 11: Syntax of meta-expression definition.