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, subclasse...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Bol, Roland N. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1990
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,25
Schlagworte:	Deductive databases Logic programming
Online-Zugang:	kostenfrei
Zusammenfassung:	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 It appears that unnecessary complications in the proof of the theorem can be avoided by introducing a normal form for SLD-derivations, allowing only certain most general unifiers. This normal form might have other applications than those in the area of loop checking.
Beschreibung:	29 S.