Using the Reform inference system for parallel Prolog:
Abstract: "We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Uppsala, Sweden
1992
|
| Schriftenreihe: | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report
69 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of parallel processing and describe parallel Reform Prolog solutions of some programming problems." |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011000571 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961015s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)36009268 | ||
| 035 | |a (DE-599)BVBBV011000571 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Millroth, Håkan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Using the Reform inference system for parallel Prolog |c Håkan Millroth |
| 264 | 1 | |a Uppsala, Sweden |c 1992 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |v 69 | |
| 520 | 3 | |a Abstract: "We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of parallel processing and describe parallel Reform Prolog solutions of some programming problems." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 650 | 4 | |a Recursive programming | |
| 830 | 0 | |a Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |v 69 |w (DE-604)BV011000452 |9 69 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007364582 | ||
Datensatz im Suchindex
| _version_ | 1804125491412598784 |
|---|---|
| any_adam_object | |
| author | Millroth, Håkan |
| author_facet | Millroth, Håkan |
| author_role | aut |
| author_sort | Millroth, Håkan |
| author_variant | h m hm |
| building | Verbundindex |
| bvnumber | BV011000571 |
| ctrlnum | (OCoLC)36009268 (DE-599)BVBBV011000571 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01666nam a2200325 cb4500</leader><controlfield tag="001">BV011000571</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961015s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36009268</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011000571</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">Millroth, Håkan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Using the Reform inference system for parallel Prolog</subfield><subfield code="c">Håkan Millroth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Uppsala, Sweden</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report</subfield><subfield code="v">69</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of parallel processing and describe parallel Reform Prolog solutions of some programming problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</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">Recursive programming</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report</subfield><subfield code="v">69</subfield><subfield code="w">(DE-604)BV011000452</subfield><subfield code="9">69</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007364582</subfield></datafield></record></collection> |
| id | DE-604.BV011000571 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:02:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007364582 |
| oclc_num | 36009268 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |
| series2 | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |
| spelling | Millroth, Håkan Verfasser aut Using the Reform inference system for parallel Prolog Håkan Millroth Uppsala, Sweden 1992 13 S. txt rdacontent n rdamedia nc rdacarrier Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 69 Abstract: "We show how a new method for parallel logic programming, based on compilation of Tärnlund's inference system Reform, can be applied to the logic programming language Prolog. We retain the sequential left-to-right depth-first backtracking scheme with one exception: the recursion levels of a recursive program, including the head unifications at each level, are computed in parallel. We discuss criteria for when a program is amenable to this kind of parallel processing and describe parallel Reform Prolog solutions of some programming problems." Logic programming Parallel programming (Computer science) Prolog (Computer program language) Recursive programming Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 69 (DE-604)BV011000452 69 |
| spellingShingle | Millroth, Håkan Using the Reform inference system for parallel Prolog Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report Logic programming Parallel programming (Computer science) Prolog (Computer program language) Recursive programming |
| title | Using the Reform inference system for parallel Prolog |
| title_auth | Using the Reform inference system for parallel Prolog |
| title_exact_search | Using the Reform inference system for parallel Prolog |
| title_full | Using the Reform inference system for parallel Prolog Håkan Millroth |
| title_fullStr | Using the Reform inference system for parallel Prolog Håkan Millroth |
| title_full_unstemmed | Using the Reform inference system for parallel Prolog Håkan Millroth |
| title_short | Using the Reform inference system for parallel Prolog |
| title_sort | using the reform inference system for parallel prolog |
| topic | Logic programming Parallel programming (Computer science) Prolog (Computer program language) Recursive programming |
| topic_facet | Logic programming Parallel programming (Computer science) Prolog (Computer program language) Recursive programming |
| volume_link | (DE-604)BV011000452 |
| work_keys_str_mv | AT millrothhakan usingthereforminferencesystemforparallelprolog |