Proving termination of general PROLOG programs:
Abstract: "We study here termination of general logic programs with the Prolog selection rule. To this end we extend the approach of Apt and Pedreschi [AP90] and consider the class of left terminating general programs. These are general logic programs that terminate with the Prolog selection ru...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,11 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We study here termination of general logic programs with the Prolog selection rule. To this end we extend the approach of Apt and Pedreschi [AP90] and consider the class of left terminating general programs. These are general logic programs that terminate with the Prolog selection rule for all ground goals. We introduce the notion of an acceptable program and prove that acceptable programs are left terminating. This provides us with a practical method of proving termination. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating program is acceptable. Finally, we prove that various ways of defining semantics coincide for acceptable programs The method is illustrated by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals. |
| Beschreibung: | 23 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224816 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27318167 | ||
| 035 | |a (DE-599)BVBBV009224816 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
| 245 | 1 | 0 | |a Proving termination of general PROLOG programs |c K. R. Apt ; D. Pedreschi |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 23 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 91,11 | |
| 520 | 3 | |a Abstract: "We study here termination of general logic programs with the Prolog selection rule. To this end we extend the approach of Apt and Pedreschi [AP90] and consider the class of left terminating general programs. These are general logic programs that terminate with the Prolog selection rule for all ground goals. We introduce the notion of an acceptable program and prove that acceptable programs are left terminating. This provides us with a practical method of proving termination. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating program is acceptable. Finally, we prove that various ways of defining semantics coincide for acceptable programs | |
| 520 | 3 | |a The method is illustrated by giving simple proofs of termination of a 'game' program and the transitive closure program 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 | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,11 |w (DE-604)BV008928356 |9 91,11 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006133971 | ||
Datensatz im Suchindex
| _version_ | 1804123667890700288 |
|---|---|
| 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 | BV009224816 |
| ctrlnum | (OCoLC)27318167 (DE-599)BVBBV009224816 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01996nam a2200325 cb4500</leader><controlfield tag="001">BV009224816</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27318167</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224816</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></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">Proving termination of general PROLOG programs</subfield><subfield code="c">K. R. Apt ; D. Pedreschi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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">91,11</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study here termination of general logic programs with the Prolog selection rule. To this end we extend the approach of Apt and Pedreschi [AP90] and consider the class of left terminating general programs. These are general logic programs that terminate with the Prolog selection rule for all ground goals. We introduce the notion of an acceptable program and prove that acceptable programs are left terminating. This provides us with a practical method of proving termination. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating program is acceptable. Finally, we prove that various ways of defining semantics coincide for acceptable programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The method is illustrated 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">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="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">91,11</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133971</subfield></datafield></record></collection> |
| id | DE-604.BV009224816 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133971 |
| oclc_num | 27318167 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 23 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 Proving termination of general PROLOG programs K. R. Apt ; D. Pedreschi Amsterdam 1991 23 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,11 Abstract: "We study here termination of general logic programs with the Prolog selection rule. To this end we extend the approach of Apt and Pedreschi [AP90] and consider the class of left terminating general programs. These are general logic programs that terminate with the Prolog selection rule for all ground goals. We introduce the notion of an acceptable program and prove that acceptable programs are left terminating. This provides us with a practical method of proving termination. The converse implication does not hold but we show that under the assumption of non-floundering from ground goals every left terminating program is acceptable. Finally, we prove that various ways of defining semantics coincide for acceptable programs The method is illustrated by giving simple proofs of termination of a 'game' program and the transitive closure program for the desired class of goals. Logic programming Prolog (Computer program language) Pedreschi, Dino Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,11 (DE-604)BV008928356 91,11 |
| spellingShingle | Apt, Krzysztof R. 1949- Pedreschi, Dino Proving termination of general PROLOG programs Logic programming Prolog (Computer program language) |
| title | Proving termination of general PROLOG programs |
| title_auth | Proving termination of general PROLOG programs |
| title_exact_search | Proving termination of general PROLOG programs |
| title_full | Proving termination of general PROLOG programs K. R. Apt ; D. Pedreschi |
| title_fullStr | Proving termination of general PROLOG programs K. R. Apt ; D. Pedreschi |
| title_full_unstemmed | Proving termination of general PROLOG programs K. R. Apt ; D. Pedreschi |
| title_short | Proving termination of general PROLOG programs |
| title_sort | proving termination of general prolog programs |
| topic | Logic programming Prolog (Computer program language) |
| topic_facet | Logic programming Prolog (Computer program language) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT aptkrzysztofr provingterminationofgeneralprologprograms AT pedreschidino provingterminationofgeneralprologprograms |