Towards more efficient loop checks:
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,26 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | 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. |
| Physical Description: | 18 S. |
Staff View
MARC
| 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 |9 90,26 | |
| 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 | ||
Record in the Search Index
| _version_ | 1804123283931529216 |
|---|---|
| any_adam_object | |
| author | Bol, Roland N. |
| author_facet | Bol, Roland N. |
| author_role | aut |
| author_sort | Bol, Roland N. |
| author_variant | r n b rn rnb |
| building | Verbundindex |
| bvnumber | BV008950525 |
| collection | ebook |
| ctrlnum | (OCoLC)24021607 (DE-599)BVBBV008950525 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01956nam a2200349 cb4500</leader><controlfield tag="001">BV008950525</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220207 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24021607</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950525</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bol, Roland N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Towards more efficient loop checks</subfield><subfield code="c">R. N. Bol</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">90,26</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deductive databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">90,26</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,26</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5722</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005906088</subfield></datafield></record></collection> |
| id | DE-604.BV008950525 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005906088 |
| oclc_num | 24021607 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 18 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bol, Roland N. Verfasser aut Towards more efficient loop checks R. N. Bol Amsterdam 1990 18 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,26 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. Deductive databases Logic programming Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,26 (DE-604)BV008928356 90,26 https://ir.cwi.nl/pub/5722 Verlag kostenfrei Volltext |
| spellingShingle | Bol, Roland N. Towards more efficient loop checks Deductive databases Logic programming |
| title | Towards more efficient loop checks |
| title_auth | Towards more efficient loop checks |
| title_exact_search | Towards more efficient loop checks |
| title_full | Towards more efficient loop checks R. N. Bol |
| title_fullStr | Towards more efficient loop checks R. N. Bol |
| title_full_unstemmed | Towards more efficient loop checks R. N. Bol |
| title_short | Towards more efficient loop checks |
| title_sort | towards more efficient loop checks |
| topic | Deductive databases Logic programming |
| topic_facet | Deductive databases Logic programming |
| url | https://ir.cwi.nl/pub/5722 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bolrolandn towardsmoreefficientloopchecks |