Abstract: "Loop checking is a mechanism for pruning infinite SLD-derivations. Most loop checks essentially compare the goals in a derivation: a derivation is pruned if 'sufficiently similar' goals are detected. In theory a goal is usually compared with every previous goal in the deriv...

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,26
Schlagworte:	Deductive databases Logic programming
Online-Zugang:	Volltext
Zusammenfassung:	Abstract: "Loop checking is a mechanism for pruning infinite SLD-derivations. Most loop checks essentially compare the goals in a derivation: a derivation is pruned if 'sufficiently similar' goals are detected. In theory a goal is usually compared with every previous goal in the derivation, but in practice such loop checks are too expensive. Here we investigate how to alter such loop checks to obtain less expensive ones (notably such that the number of comparisons performed is linear in the number of goals generated) while retaining the soundness and completeness results of the original loop check To this end we modify Van Gelder's [vG] 'tortoise-and-hare' technique and study in detail the number of comparisons performed by a loop check whose checkpoints are placed in accordance with the triangular numbers.
Beschreibung:	18 S.