Derivation of efficient logic programs by synthesizing new predicates:
Abstract: "This paper shows a strategy of logic program transformation based on unfold/fold rules. In unfold/fold transformation, efficiency is often improved by performing folding steps, and folding steps are often allowed by synthesizing new auxiliary predicates. Since atoms in the body of a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
678 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper shows a strategy of logic program transformation based on unfold/fold rules. In unfold/fold transformation, efficiency is often improved by performing folding steps, and folding steps are often allowed by synthesizing new auxiliary predicates. Since atoms in the body of a clause used to fold should be more general than atoms to be folded, new predicates are often found by generalizing atoms in the body of the clauses. Our method synthesizes new predicates automatically with suitable generalization steps in many cases. An extension of this method to incorporate goal replacement transformation is also shown." |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954501 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26039962 | ||
| 035 | |a (DE-599)BVBBV010954501 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kawamura, Tadashi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Derivation of efficient logic programs by synthesizing new predicates |c by T. Kawamura |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 678 | |
| 520 | 3 | |a Abstract: "This paper shows a strategy of logic program transformation based on unfold/fold rules. In unfold/fold transformation, efficiency is often improved by performing folding steps, and folding steps are often allowed by synthesizing new auxiliary predicates. Since atoms in the body of a clause used to fold should be more general than atoms to be folded, new predicates are often found by generalizing atoms in the body of the clauses. Our method synthesizes new predicates automatically with suitable generalization steps in many cases. An extension of this method to incorporate goal replacement transformation is also shown." | |
| 650 | 4 | |a Logic programming | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 678 |w (DE-604)BV010923438 |9 678 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326846 | ||
Datensatz im Suchindex
| _version_ | 1804125441452146688 |
|---|---|
| any_adam_object | |
| author | Kawamura, Tadashi |
| author_facet | Kawamura, Tadashi |
| author_role | aut |
| author_sort | Kawamura, Tadashi |
| author_variant | t k tk |
| building | Verbundindex |
| bvnumber | BV010954501 |
| ctrlnum | (OCoLC)26039962 (DE-599)BVBBV010954501 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01577nam a2200289 cb4500</leader><controlfield tag="001">BV010954501</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039962</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954501</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">Kawamura, Tadashi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Derivation of efficient logic programs by synthesizing new predicates</subfield><subfield code="c">by T. Kawamura</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">678</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper shows a strategy of logic program transformation based on unfold/fold rules. In unfold/fold transformation, efficiency is often improved by performing folding steps, and folding steps are often allowed by synthesizing new auxiliary predicates. Since atoms in the body of a clause used to fold should be more general than atoms to be folded, new predicates are often found by generalizing atoms in the body of the clauses. Our method synthesizes new predicates automatically with suitable generalization steps in many cases. An extension of this method to incorporate goal replacement transformation is also shown."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">678</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">678</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326846</subfield></datafield></record></collection> |
| id | DE-604.BV010954501 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326846 |
| oclc_num | 26039962 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Kawamura, Tadashi Verfasser aut Derivation of efficient logic programs by synthesizing new predicates by T. Kawamura Tokyo, Japan 1991 20 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 678 Abstract: "This paper shows a strategy of logic program transformation based on unfold/fold rules. In unfold/fold transformation, efficiency is often improved by performing folding steps, and folding steps are often allowed by synthesizing new auxiliary predicates. Since atoms in the body of a clause used to fold should be more general than atoms to be folded, new predicates are often found by generalizing atoms in the body of the clauses. Our method synthesizes new predicates automatically with suitable generalization steps in many cases. An extension of this method to incorporate goal replacement transformation is also shown." Logic programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 678 (DE-604)BV010923438 678 |
| spellingShingle | Kawamura, Tadashi Derivation of efficient logic programs by synthesizing new predicates Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming |
| title | Derivation of efficient logic programs by synthesizing new predicates |
| title_auth | Derivation of efficient logic programs by synthesizing new predicates |
| title_exact_search | Derivation of efficient logic programs by synthesizing new predicates |
| title_full | Derivation of efficient logic programs by synthesizing new predicates by T. Kawamura |
| title_fullStr | Derivation of efficient logic programs by synthesizing new predicates by T. Kawamura |
| title_full_unstemmed | Derivation of efficient logic programs by synthesizing new predicates by T. Kawamura |
| title_short | Derivation of efficient logic programs by synthesizing new predicates |
| title_sort | derivation of efficient logic programs by synthesizing new predicates |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT kawamuratadashi derivationofefficientlogicprogramsbysynthesizingnewpredicates |