Studies in pure Prolog: termination
Abstract: "We provide a theoretical basis for studying termination of logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. First we show that vario...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,48 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | Abstract: "We provide a theoretical basis for studying termination of logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. First we show that various ways of defining semantics coincide for left terminating programs. Then we offer a characterization of left terminating programs that provides us with a practical method of proving termination. The method is proven to be complete and is illustrated by giving simple proofs of termination of the quicksort, permutation and mergesort programs for the desired class of goals." |
| Physical Description: | 25 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973930 | ||
| 003 | DE-604 | ||
| 005 | 20220221 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23926731 | ||
| 035 | |a (DE-599)BVBBV008973930 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
| 245 | 1 | 0 | |a Studies in pure Prolog |b termination |c Krzysztof R. Apt ; Dino Pedreschi |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 25 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,48 | |
| 520 | 3 | |a Abstract: "We provide a theoretical basis for studying termination of logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. First we show that various ways of defining semantics coincide for left terminating programs. Then we offer a characterization of left terminating programs that provides us with a practical method of proving termination. The method is proven to be complete and is illustrated by giving simple proofs of termination of the quicksort, permutation and mergesort programs for the desired class of goals." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 700 | 1 | |a Pedreschi, Dino |e Verfasser |4 aut | |
| 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,48 |w (DE-604)BV008928356 |9 90,48 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5702 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925580 | ||
Record in the Search Index
| _version_ | 1804123311897051136 |
|---|---|
| any_adam_object | |
| author | Apt, Krzysztof R. 1949- Pedreschi, Dino |
| author_GND | (DE-588)110139763 |
| author_facet | Apt, Krzysztof R. 1949- Pedreschi, Dino |
| author_role | aut aut |
| author_sort | Apt, Krzysztof R. 1949- |
| author_variant | k r a kr kra d p dp |
| building | Verbundindex |
| bvnumber | BV008973930 |
| collection | ebook |
| ctrlnum | (OCoLC)23926731 (DE-599)BVBBV008973930 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01910nam a2200349 cb4500</leader><controlfield tag="001">BV008973930</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23926731</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973930</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">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Studies in pure Prolog</subfield><subfield code="b">termination</subfield><subfield code="c">Krzysztof R. Apt ; Dino Pedreschi</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">25 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,48</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We provide a theoretical basis for studying termination of logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. First we show that various ways of defining semantics coincide for left terminating programs. Then we offer a characterization of left terminating programs that provides us with a practical method of proving termination. The method is proven to be complete and is illustrated by giving simple proofs of termination of the quicksort, permutation and mergesort programs for the desired class of goals."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pedreschi, Dino</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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,48</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,48</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5702</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-005925580</subfield></datafield></record></collection> |
| id | DE-604.BV008973930 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925580 |
| oclc_num | 23926731 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 25 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 | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut Studies in pure Prolog termination Krzysztof R. Apt ; Dino Pedreschi Amsterdam 1990 25 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,48 Abstract: "We provide a theoretical basis for studying termination of logic programs with the Prolog selection rule. To this end we study the class of left terminating programs. These are logic programs that terminate with the Prolog selection rule for all ground goals. First we show that various ways of defining semantics coincide for left terminating programs. Then we offer a characterization of left terminating programs that provides us with a practical method of proving termination. The method is proven to be complete and is illustrated by giving simple proofs of termination of the quicksort, permutation and mergesort programs for the desired class of goals." Logic programming Prolog (Computer program language) Pedreschi, Dino Verfasser aut Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,48 (DE-604)BV008928356 90,48 https://ir.cwi.nl/pub/5702 Verlag kostenfrei Volltext |
| spellingShingle | Apt, Krzysztof R. 1949- Pedreschi, Dino Studies in pure Prolog termination Logic programming Prolog (Computer program language) |
| title | Studies in pure Prolog termination |
| title_auth | Studies in pure Prolog termination |
| title_exact_search | Studies in pure Prolog termination |
| title_full | Studies in pure Prolog termination Krzysztof R. Apt ; Dino Pedreschi |
| title_fullStr | Studies in pure Prolog termination Krzysztof R. Apt ; Dino Pedreschi |
| title_full_unstemmed | Studies in pure Prolog termination Krzysztof R. Apt ; Dino Pedreschi |
| title_short | Studies in pure Prolog |
| title_sort | studies in pure prolog termination |
| title_sub | termination |
| topic | Logic programming Prolog (Computer program language) |
| topic_facet | Logic programming Prolog (Computer program language) |
| url | https://ir.cwi.nl/pub/5702 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT aptkrzysztofr studiesinpureprologtermination AT pedreschidino studiesinpureprologtermination |