Examples of predicate

• 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.

• Automating the detection and handling of higher-order predicates is an important part of future work.

• Domain predicates are predicates that are defined nonrecursively.

• Moreover, he can specify a set of table definitions; note that each specified table is mapped into one of the program predicates.

• Partial predicates provide the necessary semantic ground and the advances in set constraint resolution makes unnecessary to reinvent the wheel.

• One of the uses of dynamic predicates is memoization: this is explained with an example.

• Thus, it does not use such predicates which are assembly specific.

• Also, we might want to restrict unfolding of user-defined predicates to cases where only one clause matches.