Characterizing termination of logic programs with level mappings:
Abstract: "We study a large class of logic programs which terminate with respect to a natural class of goals. Both classes are characterized in terms of level mappings. The class of logic programs is strong enough to compute every total recursive function. The class of goals considerably extend...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1989
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,12 |
| Subjects: | |
| Summary: | Abstract: "We study a large class of logic programs which terminate with respect to a natural class of goals. Both classes are characterized in terms of level mappings. The class of logic programs is strong enough to compute every total recursive function. The class of goals considerably extends the variable-free ones. Based on the ideas developed in this paper we present a technique which improves the termination behaviour of Prolog programs." |
| Physical Description: | 10 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245987 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)20959376 | ||
| 035 | |a (DE-599)BVBBV009245987 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bezem, Marc |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Characterizing termination of logic programs with level mappings |c M. Bezem |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 10 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 89,12 | |
| 520 | 3 | |a Abstract: "We study a large class of logic programs which terminate with respect to a natural class of goals. Both classes are characterized in terms of level mappings. The class of logic programs is strong enough to compute every total recursive function. The class of goals considerably extends the variable-free ones. Based on the ideas developed in this paper we present a technique which improves the termination behaviour of Prolog programs." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,12 |w (DE-604)BV008928356 |9 89,12 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006152326 | ||
Record in the Search Index
| _version_ | 1804123693268336640 |
|---|---|
| any_adam_object | |
| author | Bezem, Marc |
| author_facet | Bezem, Marc |
| author_role | aut |
| author_sort | Bezem, Marc |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV009245987 |
| ctrlnum | (OCoLC)20959376 (DE-599)BVBBV009245987 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01457nam a2200301 cb4500</leader><controlfield tag="001">BV009245987</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20959376</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245987</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">Bezem, Marc</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Characterizing termination of logic programs with level mappings</subfield><subfield code="c">M. Bezem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">89,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study a large class of logic programs which terminate with respect to a natural class of goals. Both classes are characterized in terms of level mappings. The class of logic programs is strong enough to compute every total recursive function. The class of goals considerably extends the variable-free ones. Based on the ideas developed in this paper we present a technique which improves the termination behaviour of Prolog programs."</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="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">89,12</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,12</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152326</subfield></datafield></record></collection> |
| id | DE-604.BV009245987 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152326 |
| oclc_num | 20959376 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 10 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bezem, Marc Verfasser aut Characterizing termination of logic programs with level mappings M. Bezem Amsterdam 1989 10 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,12 Abstract: "We study a large class of logic programs which terminate with respect to a natural class of goals. Both classes are characterized in terms of level mappings. The class of logic programs is strong enough to compute every total recursive function. The class of goals considerably extends the variable-free ones. Based on the ideas developed in this paper we present a technique which improves the termination behaviour of Prolog programs." Logic programming Prolog (Computer program language) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,12 (DE-604)BV008928356 89,12 |
| spellingShingle | Bezem, Marc Characterizing termination of logic programs with level mappings Logic programming Prolog (Computer program language) |
| title | Characterizing termination of logic programs with level mappings |
| title_auth | Characterizing termination of logic programs with level mappings |
| title_exact_search | Characterizing termination of logic programs with level mappings |
| title_full | Characterizing termination of logic programs with level mappings M. Bezem |
| title_fullStr | Characterizing termination of logic programs with level mappings M. Bezem |
| title_full_unstemmed | Characterizing termination of logic programs with level mappings M. Bezem |
| title_short | Characterizing termination of logic programs with level mappings |
| title_sort | characterizing termination of logic programs with level mappings |
| 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 bezemmarc characterizingterminationoflogicprogramswithlevelmappings |