Generalizing completeness results for loop checks
Roland N. Bol · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1990
Abstract: "Loop checking is a mechanism for pruning infinite SLD-derivations. In [BAK], simple loop checks were introduced and their soundness, completeness and relative strength was studied. Since no sound and complete simple loop check exists even in the absence of function symbols, subclasses of programs were determined for which the (sound) loop checks introduced in [BAK] are complete. In this paper, the Generalization Theorem is proven. This theorem presents a method to extend (under certain conditions) a class of programs for which a given loop check is complete to a larger class, for which the loop check is still complete. Then this theorem is applied to the results of [BAK], giving rise to stronger completeness theorems