Reasoning about termination of Prolog programs:
Abstract: "We provide a theoretical basis for studying termination of (general) 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. We offer a cha...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,14 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We provide a theoretical basis for studying termination of (general) 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. We offer a characterization of left terminating positive programs by means of the notion of an acceptable program that provides us with a practical method of proving termination. The method is illustrated by giving a simple proof of termination of the quicksort program for the desired class of goals. Then we extend this approach to the class of general logic programs by modifying the concept of acceptability We prove that acceptable general programs are left terminating. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating general program is acceptable. Finally, we prove that various ways of defining semantics coicide for acceptable general programs. We illustrate the use of this extension by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals. |
| Beschreibung: | 45 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848319 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)27332725 | ||
| 035 | |a (DE-599)BVBBV010848319 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
| 245 | 1 | 0 | |a Reasoning about termination of Prolog programs |c K. R. Apt ; D. Pedreschi |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 45 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,14 | |
| 520 | 3 | |a Abstract: "We provide a theoretical basis for studying termination of (general) 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. We offer a characterization of left terminating positive programs by means of the notion of an acceptable program that provides us with a practical method of proving termination. The method is illustrated by giving a simple proof of termination of the quicksort program for the desired class of goals. Then we extend this approach to the class of general logic programs by modifying the concept of acceptability | |
| 520 | 3 | |a We prove that acceptable general programs are left terminating. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating general program is acceptable. Finally, we prove that various ways of defining semantics coicide for acceptable general programs. We illustrate the use of this extension by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals. | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 700 | 1 | |a Pedreschi, Dino |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,14 |w (DE-604)BV010841375 |9 1991,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250938 | ||
Datensatz im Suchindex
| _version_ | 1804125334293970944 |
|---|---|
| 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 | BV010848319 |
| ctrlnum | (OCoLC)27332725 (DE-599)BVBBV010848319 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02231nam a2200313 cb4500</leader><controlfield tag="001">BV010848319</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27332725</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848319</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-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">Reasoning about termination of Prolog programs</subfield><subfield code="c">K. R. Apt ; D. Pedreschi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">45 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">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,14</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We provide a theoretical basis for studying termination of (general) 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. We offer a characterization of left terminating positive programs by means of the notion of an acceptable program that provides us with a practical method of proving termination. The method is illustrated by giving a simple proof of termination of the quicksort program for the desired class of goals. Then we extend this approach to the class of general logic programs by modifying the concept of acceptability</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We prove that acceptable general programs are left terminating. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating general program is acceptable. Finally, we prove that various ways of defining semantics coicide for acceptable general programs. We illustrate the use of this extension by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals.</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="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,14</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250938</subfield></datafield></record></collection> |
| id | DE-604.BV010848319 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250938 |
| oclc_num | 27332725 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 45 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut Reasoning about termination of Prolog programs K. R. Apt ; D. Pedreschi Pisa 1991 45 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,14 Abstract: "We provide a theoretical basis for studying termination of (general) 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. We offer a characterization of left terminating positive programs by means of the notion of an acceptable program that provides us with a practical method of proving termination. The method is illustrated by giving a simple proof of termination of the quicksort program for the desired class of goals. Then we extend this approach to the class of general logic programs by modifying the concept of acceptability We prove that acceptable general programs are left terminating. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating general program is acceptable. Finally, we prove that various ways of defining semantics coicide for acceptable general programs. We illustrate the use of this extension by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals. Prolog (Computer program language) Pedreschi, Dino Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,14 (DE-604)BV010841375 1991,14 |
| spellingShingle | Apt, Krzysztof R. 1949- Pedreschi, Dino Reasoning about termination of Prolog programs Prolog (Computer program language) |
| title | Reasoning about termination of Prolog programs |
| title_auth | Reasoning about termination of Prolog programs |
| title_exact_search | Reasoning about termination of Prolog programs |
| title_full | Reasoning about termination of Prolog programs K. R. Apt ; D. Pedreschi |
| title_fullStr | Reasoning about termination of Prolog programs K. R. Apt ; D. Pedreschi |
| title_full_unstemmed | Reasoning about termination of Prolog programs K. R. Apt ; D. Pedreschi |
| title_short | Reasoning about termination of Prolog programs |
| title_sort | reasoning about termination of prolog programs |
| topic | Prolog (Computer program language) |
| topic_facet | Prolog (Computer program language) |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT aptkrzysztofr reasoningaboutterminationofprologprograms AT pedreschidino reasoningaboutterminationofprologprograms |