Inductive theorem proving based on term rewriting:
Abstract: "An equation which is valid in the initial model of an equational theory is called an inductive theorem. In this paper, we present an inductive theorem proving method that is an extension of the so- called inductive completion procedures. Compared with these procedures, our method can...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1992
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
754 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "An equation which is valid in the initial model of an equational theory is called an inductive theorem. In this paper, we present an inductive theorem proving method that is an extension of the so- called inductive completion procedures. Compared with these procedures, our method can handle unorientable axioms and theorems and, therefore, does not fail. The method has been implemented on Metis, an experimental system for term rewriting techniques." |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956605 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960919s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)27482825 | ||
| 035 | |a (DE-599)BVBBV010956605 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ohsuga, Akihito |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Inductive theorem proving based on term rewriting |c by A. Ohsuga |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 11 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 754 | |
| 520 | 3 | |a Abstract: "An equation which is valid in the initial model of an equational theory is called an inductive theorem. In this paper, we present an inductive theorem proving method that is an extension of the so- called inductive completion procedures. Compared with these procedures, our method can handle unorientable axioms and theorems and, therefore, does not fail. The method has been implemented on Metis, an experimental system for term rewriting techniques." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 754 |w (DE-604)BV010923438 |9 754 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328721 | ||
Datensatz im Suchindex
| _version_ | 1804125443880648704 |
|---|---|
| any_adam_object | |
| author | Ohsuga, Akihito |
| author_facet | Ohsuga, Akihito |
| author_role | aut |
| author_sort | Ohsuga, Akihito |
| author_variant | a o ao |
| building | Verbundindex |
| bvnumber | BV010956605 |
| ctrlnum | (OCoLC)27482825 (DE-599)BVBBV010956605 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01399nam a2200289 cb4500</leader><controlfield tag="001">BV010956605</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960919s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27482825</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956605</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, Akihito</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Inductive theorem proving based on term rewriting</subfield><subfield code="c">by A. Ohsuga</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 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">754</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "An equation which is valid in the initial model of an equational theory is called an inductive theorem. In this paper, we present an inductive theorem proving method that is an extension of the so- called inductive completion procedures. Compared with these procedures, our method can handle unorientable axioms and theorems and, therefore, does not fail. The method has been implemented on Metis, an experimental system for term rewriting techniques."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</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">754</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">754</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328721</subfield></datafield></record></collection> |
| id | DE-604.BV010956605 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328721 |
| oclc_num | 27482825 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 | Ohsuga, Akihito Verfasser aut Inductive theorem proving based on term rewriting by A. Ohsuga Tokyo, Japan 1992 11 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 754 Abstract: "An equation which is valid in the initial model of an equational theory is called an inductive theorem. In this paper, we present an inductive theorem proving method that is an extension of the so- called inductive completion procedures. Compared with these procedures, our method can handle unorientable axioms and theorems and, therefore, does not fail. The method has been implemented on Metis, an experimental system for term rewriting techniques." Rewriting systems (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 754 (DE-604)BV010923438 754 |
| spellingShingle | Ohsuga, Akihito Inductive theorem proving based on term rewriting Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Rewriting systems (Computer science) |
| title | Inductive theorem proving based on term rewriting |
| title_auth | Inductive theorem proving based on term rewriting |
| title_exact_search | Inductive theorem proving based on term rewriting |
| title_full | Inductive theorem proving based on term rewriting by A. Ohsuga |
| title_fullStr | Inductive theorem proving based on term rewriting by A. Ohsuga |
| title_full_unstemmed | Inductive theorem proving based on term rewriting by A. Ohsuga |
| title_short | Inductive theorem proving based on term rewriting |
| title_sort | inductive theorem proving based on term rewriting |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ohsugaakihito inductivetheoremprovingbasedontermrewriting |