On the other hand, performing abductive reasoning on the event rules defines changes on base predicates needed to satisfy changes on derived predicates.
Let us show the translation of several domains of properties into the language of partial predicates and exemplify checking by means of equational reasoning.
Informally speaking, they are logic predicates that represent the degree of evaluation of an expression (demand properties).
In the other benchmarks a much smaller fraction of unifications can be improved due to the heavy use of non-deterministic predicates.
Every (logic) programmer should have, at least in her mind, intended meaning for all the used predicates.
Indeed, consuming invalid tabled answers may result in finding more invalid answers for the same or other tabled predicates.
Note that concept names are translated to unary free predicates, whereas n-ary role names are translated to n-ary free predicates.
Basically, the specialization technique will consist on specialization of rules by removing and reordering predicates.
