Reforming compilation of logic programs:
Abstract: "We present a new method for parallel logic programming which is based on compilation of Tärnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative code. Beside earlier parallel concepts, such as OR-parallelism and AND- paralleli...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Uppsala, Sweden
1991
|
Schriftenreihe: | Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report
67 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We present a new method for parallel logic programming which is based on compilation of Tärnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative code. Beside earlier parallel concepts, such as OR-parallelism and AND- parallelism, we have new forms of Reform parallelism: unification parallelism and recursion parallelism. These are implemented in our method by applying standard loop parallelization techniques to the iterative code obtained by compilation." |
Beschreibung: | 15 Bl. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011000503 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 961015s1991 |||| 00||| engod | ||
035 | |a (OCoLC)36009259 | ||
035 | |a (DE-599)BVBBV011000503 | ||
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 Reforming compilation of logic programs |c Håkan Millroth |
264 | 1 | |a Uppsala, Sweden |c 1991 | |
300 | |a 15 Bl. | ||
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 67 | |
520 | 3 | |a Abstract: "We present a new method for parallel logic programming which is based on compilation of Tärnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative code. Beside earlier parallel concepts, such as OR-parallelism and AND- parallelism, we have new forms of Reform parallelism: unification parallelism and recursion parallelism. These are implemented in our method by applying standard loop parallelization techniques to the iterative code obtained by compilation." | |
650 | 4 | |a Compiling (Electronic computers) | |
650 | 4 | |a Logic programming | |
650 | 4 | |a Parallel processing (Electronic computers) | |
650 | 4 | |a Recursive programming | |
655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
830 | 0 | |a Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report |v 67 |w (DE-604)BV011000452 |9 67 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007364522 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804125491350732800 |
---|---|
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 | BV011000503 |
ctrlnum | (OCoLC)36009259 (DE-599)BVBBV011000503 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01775nam a2200349 cb4500</leader><controlfield tag="001">BV011000503</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961015s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36009259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011000503</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">Reforming compilation of logic programs</subfield><subfield code="c">Håkan Millroth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Uppsala, Sweden</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 Bl.</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">67</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a new method for parallel logic programming which is based on compilation of Tärnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative code. Beside earlier parallel concepts, such as OR-parallelism and AND- parallelism, we have new forms of Reform parallelism: unification parallelism and recursion parallelism. These are implemented in our method by applying standard loop parallelization techniques to the iterative code obtained by compilation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compiling (Electronic computers)</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 processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive programming</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</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">67</subfield><subfield code="w">(DE-604)BV011000452</subfield><subfield code="9">67</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007364522</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV011000503 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:02:24Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007364522 |
oclc_num | 36009259 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 15 Bl. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
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 Reforming compilation of logic programs Håkan Millroth Uppsala, Sweden 1991 15 Bl. txt rdacontent n rdamedia nc rdacarrier Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 67 Abstract: "We present a new method for parallel logic programming which is based on compilation of Tärnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative code. Beside earlier parallel concepts, such as OR-parallelism and AND- parallelism, we have new forms of Reform parallelism: unification parallelism and recursion parallelism. These are implemented in our method by applying standard loop parallelization techniques to the iterative code obtained by compilation." Compiling (Electronic computers) Logic programming Parallel processing (Electronic computers) Recursive programming 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report 67 (DE-604)BV011000452 67 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Millroth, Håkan Reforming compilation of logic programs Uppsala Programming Methodology and Artificial Intelligence Laboratory: UPMAIL technical report Compiling (Electronic computers) Logic programming Parallel processing (Electronic computers) Recursive programming |
subject_GND | (DE-588)4113937-9 |
title | Reforming compilation of logic programs |
title_auth | Reforming compilation of logic programs |
title_exact_search | Reforming compilation of logic programs |
title_full | Reforming compilation of logic programs Håkan Millroth |
title_fullStr | Reforming compilation of logic programs Håkan Millroth |
title_full_unstemmed | Reforming compilation of logic programs Håkan Millroth |
title_short | Reforming compilation of logic programs |
title_sort | reforming compilation of logic programs |
topic | Compiling (Electronic computers) Logic programming Parallel processing (Electronic computers) Recursive programming |
topic_facet | Compiling (Electronic computers) Logic programming Parallel processing (Electronic computers) Recursive programming Hochschulschrift |
volume_link | (DE-604)BV011000452 |
work_keys_str_mv | AT millrothhakan reformingcompilationoflogicprograms |