Comparison of Logic Algorithms

It is also important to compare logic algorithms for the same intended relation % Indeed, this is useful in stepwise synthesis to compare intermediate logic algorithms, and to establish progression criteria. 

Let L(r) be the set of all possible logic algorithms of rin, where the bodies only involve some fixed set of primitive predicates and the r/n predicate, and where Xi .. Xn the distinct variables used in the heads. Let  

In Section 7.2.1, we define a criterion for comparing logic algorithms in terms of generality. Since verifying this criterion is only semi-decidable, we introduce, in Section 7.2.2, a sound approximation of it, namely syntactic generalization. 

---