Efficient implementation of basic narrowing:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
700 |
| Schlagwörter: | |
| Abstract: | Abstract: "This paper presents an efficient method of implementing reduction and narrowing in Metis. Metis is a term rewriting system generator developed at the Institute for New Generation Computer Technology (ICOT). Its main facilities are the Knuth-Bendix completion procedure, refutational theorem proving and inductive theorem proving (inductionless induction). This method is an extension of basic narrowing techniques and we show how the method prunes redundancies of each derivation step." |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010970443 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960925s1989 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)23004335 | ||
| 035 | |a (DE-599)BVBBV010970443 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ohsuga, Akihiko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient implementation of basic narrowing |c by A. Ohsuga & K. Sakai |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 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 memorandum |v 700 | |
| 520 | 3 | |a Abstract: "This paper presents an efficient method of implementing reduction and narrowing in Metis. Metis is a term rewriting system generator developed at the Institute for New Generation Computer Technology (ICOT). Its main facilities are the Knuth-Bendix completion procedure, refutational theorem proving and inductive theorem proving (inductionless induction). This method is an extension of basic narrowing techniques and we show how the method prunes redundancies of each derivation step." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Sakai, Ko |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 700 |w (DE-604)BV010943497 |9 700 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007340149 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6122-700 |
|---|---|
| DE-BY-TUM_katkey | 767310 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010304255 |
| _version_ | 1821938211750936577 |
| any_adam_object | |
| author | Ohsuga, Akihiko Sakai, Ko |
| author_facet | Ohsuga, Akihiko Sakai, Ko |
| author_role | aut aut |
| author_sort | Ohsuga, Akihiko |
| author_variant | a o ao k s ks |
| building | Verbundindex |
| bvnumber | BV010970443 |
| ctrlnum | (OCoLC)23004335 (DE-599)BVBBV010970443 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01467nam a2200289 cb4500</leader><controlfield tag="001">BV010970443</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960925s1989 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23004335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010970443</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">Ohsuga, Akihiko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient implementation of basic narrowing</subfield><subfield code="c">by A. Ohsuga & K. Sakai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</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 memorandum</subfield><subfield code="v">700</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents an efficient method of implementing reduction and narrowing in Metis. Metis is a term rewriting system generator developed at the Institute for New Generation Computer Technology (ICOT). Its main facilities are the Knuth-Bendix completion procedure, refutational theorem proving and inductive theorem proving (inductionless induction). This method is an extension of basic narrowing techniques and we show how the method prunes redundancies of each derivation step."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sakai, Ko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum</subfield><subfield code="v">700</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">700</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007340149</subfield></datafield></record></collection> |
| id | DE-604.BV010970443 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:04:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007340149 |
| oclc_num | 23004335 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| spellingShingle | Ohsuga, Akihiko Sakai, Ko Efficient implementation of basic narrowing Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Rewriting systems (Computer science) |
| title | Efficient implementation of basic narrowing |
| title_auth | Efficient implementation of basic narrowing |
| title_exact_search | Efficient implementation of basic narrowing |
| title_full | Efficient implementation of basic narrowing by A. Ohsuga & K. Sakai |
| title_fullStr | Efficient implementation of basic narrowing by A. Ohsuga & K. Sakai |
| title_full_unstemmed | Efficient implementation of basic narrowing by A. Ohsuga & K. Sakai |
| title_short | Efficient implementation of basic narrowing |
| title_sort | efficient implementation of basic narrowing |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT ohsugaakihiko efficientimplementationofbasicnarrowing AT sakaiko efficientimplementationofbasicnarrowing |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6122-700 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |