Modular termination proofs for logic and pure Prolog programs:
Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they c...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,16 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way." |
| Beschreibung: | 35 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034496 | ||
| 003 | DE-604 | ||
| 005 | 19940506 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31237735 | ||
| 035 | |a (DE-599)BVBBV009034496 | ||
| 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 Modular termination proofs for logic and pure Prolog programs |c K. R. Apt ; D. Pedreschi |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 35 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 93,16 | |
| 520 | 3 | |a Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 650 | 4 | |a Proof theory | |
| 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 93,16 |w (DE-604)BV008928356 |9 93,16 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005977086 | ||
Datensatz im Suchindex
| _version_ | 1804123387890499584 |
|---|---|
| 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 | BV009034496 |
| ctrlnum | (OCoLC)31237735 (DE-599)BVBBV009034496 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01455nam a2200325 cb4500</leader><controlfield tag="001">BV009034496</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940506 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31237735</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034496</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">Modular termination proofs for logic and pure 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">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 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">93,16</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way."</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="650" ind1=" " ind2="4"><subfield code="a">Proof theory</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">93,16</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,16</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005977086</subfield></datafield></record></collection> |
| id | DE-604.BV009034496 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005977086 |
| oclc_num | 31237735 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 35 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| 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 Modular termination proofs for logic and pure Prolog programs K. R. Apt ; D. Pedreschi Amsterdam 1993 35 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,16 Abstract: "We provide a uniform and simplified presentation of the methods of Bezem [Bez93] (first published as [Bez89]) and of Apt and Pedreschi [AP93] (first published as [AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be refined so that they can be used in a modular way." Logic programming Prolog (Computer program language) Proof theory Pedreschi, Dino Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,16 (DE-604)BV008928356 93,16 |
| spellingShingle | Apt, Krzysztof R. 1949- Pedreschi, Dino Modular termination proofs for logic and pure Prolog programs Logic programming Prolog (Computer program language) Proof theory |
| title | Modular termination proofs for logic and pure Prolog programs |
| title_auth | Modular termination proofs for logic and pure Prolog programs |
| title_exact_search | Modular termination proofs for logic and pure Prolog programs |
| title_full | Modular termination proofs for logic and pure Prolog programs K. R. Apt ; D. Pedreschi |
| title_fullStr | Modular termination proofs for logic and pure Prolog programs K. R. Apt ; D. Pedreschi |
| title_full_unstemmed | Modular termination proofs for logic and pure Prolog programs K. R. Apt ; D. Pedreschi |
| title_short | Modular termination proofs for logic and pure Prolog programs |
| title_sort | modular termination proofs for logic and pure prolog programs |
| topic | Logic programming Prolog (Computer program language) Proof theory |
| topic_facet | Logic programming Prolog (Computer program language) Proof theory |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT aptkrzysztofr modularterminationproofsforlogicandpureprologprograms AT pedreschidino modularterminationproofsforlogicandpureprologprograms |