B3Kat (1/1)

Speichern in

Towards more efficient loop checks

Verfasser: Bol, Roland N.

Buch

(Services, Fernleihe und weitere eXtras)

Bestand im BVB:

Volltext-Links:

kostenfrei

Dieser Titel ist Teil einer Serie/Reihe:

Centrum voor Wiskunde en Informatica<Amsterdam>

Permalink:

https://gateway-bayern.de/BV008950525

Letzte Änderung: 07.02.2022

Titel:	Towards more efficient loop checks
URL:	https://ir.cwi.nl/pub/5722
URL Erlt Interna:	Verlag
URL Erlt Info:	kostenfrei
Erläuterung :	Volltext
Von:	R. N. Bol
Erscheinungsort:	Amsterdam
Erscheinungsjahr:	1990
Umfang:	18 S.
Serie/Reihe:	Centrum voor Wiskunde en Informatica<Amsterdam>/ Department of Computer Science: Report CS
Band:	90,26
ID der Serie/Reihe:	(DE-604)BV008928356
Abstract:	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
Abstract:	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.
Sprache:	eng
Andere Ausgabe:	Erscheint auch als
_Bemerkung:	Online-Ausgabe
Weitere Schlagwörter :	Deductive databases; Logic programming

MARC-Felder:

LEADER	00000nam a2200000 cb4500
001	BV008950525
003	DE-604
005	20220207
007	t
008	940206s1990 \|\|\|\| 00\|\|\| eng d
035			\|a (OCoLC)24021607
035			\|a (DE-599)BVBBV008950525
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-29T \|a DE-91G
100	1		\|a Bol, Roland N. \|e Verfasser \|4 aut
245	1	0	\|a Towards more efficient loop checks \|c R. N. Bol
264		1	\|a Amsterdam \|c 1990
300			\|a 18 S.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Centrum voor Wiskunde en Informatica<Amsterdam>/ Department of Computer Science: Report CS \|v 90,26
520	3		\|a 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
520	3		\|a 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.
650		4	\|a Deductive databases
650		4	\|a Logic programming
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe
810	2		\|a Department of Computer Science: Report CS \|t Centrum voor Wiskunde en Informatica<Amsterdam> \|v 90,26 \|w (DE-604)BV008928356
856	4	1	\|u https://ir.cwi.nl/pub/5722 \|x Verlag \|z kostenfrei \|3 Volltext
912			\|a ebook
999			\|a oai:aleph.bib-bvb.de:BVB01-005906088