Complete E-unification based on an extension of the Knuth-Bendix completion procedure:
Abstract: "A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss more semantical unification; equational unification, which computes a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general complete proc...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
636 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss more semantical unification; equational unification, which computes a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general complete procedure that enumerates equational unifiers for a given pair of terms under a given congruence." |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953958 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24940402 | ||
| 035 | |a (DE-599)BVBBV010953958 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ohsuga, A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complete E-unification based on an extension of the Knuth-Bendix completion procedure |c by A. Ohsuga & K. Sakai |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 12 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 636 | |
| 520 | 3 | |a Abstract: "A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss more semantical unification; equational unification, which computes a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general complete procedure that enumerates equational unifiers for a given pair of terms under a given congruence." | |
| 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 report |v 636 |w (DE-604)BV010923438 |9 636 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326375 | ||
Datensatz im Suchindex
| _version_ | 1804125440831389696 |
|---|---|
| any_adam_object | |
| author | Ohsuga, A. Sakai, Ko |
| author_facet | Ohsuga, A. Sakai, Ko |
| author_role | aut aut |
| author_sort | Ohsuga, A. |
| author_variant | a o ao k s ks |
| building | Verbundindex |
| bvnumber | BV010953958 |
| ctrlnum | (OCoLC)24940402 (DE-599)BVBBV010953958 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01409nam a2200301 cb4500</leader><controlfield tag="001">BV010953958</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)24940402</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953958</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, A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complete E-unification based on an extension of the Knuth-Bendix completion procedure</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">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">636</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss more semantical unification; equational unification, which computes a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general complete procedure that enumerates equational unifiers for a given pair of terms under a given congruence."</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 report</subfield><subfield code="v">636</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">636</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326375</subfield></datafield></record></collection> |
| id | DE-604.BV010953958 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326375 |
| oclc_num | 24940402 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 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 | Ohsuga, A. Verfasser aut Complete E-unification based on an extension of the Knuth-Bendix completion procedure by A. Ohsuga & K. Sakai Tokyo, Japan 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 636 Abstract: "A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss more semantical unification; equational unification, which computes a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general complete procedure that enumerates equational unifiers for a given pair of terms under a given congruence." Rewriting systems (Computer science) Sakai, Ko Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 636 (DE-604)BV010923438 636 |
| spellingShingle | Ohsuga, A. Sakai, Ko Complete E-unification based on an extension of the Knuth-Bendix completion procedure Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Rewriting systems (Computer science) |
| title | Complete E-unification based on an extension of the Knuth-Bendix completion procedure |
| title_auth | Complete E-unification based on an extension of the Knuth-Bendix completion procedure |
| title_exact_search | Complete E-unification based on an extension of the Knuth-Bendix completion procedure |
| title_full | Complete E-unification based on an extension of the Knuth-Bendix completion procedure by A. Ohsuga & K. Sakai |
| title_fullStr | Complete E-unification based on an extension of the Knuth-Bendix completion procedure by A. Ohsuga & K. Sakai |
| title_full_unstemmed | Complete E-unification based on an extension of the Knuth-Bendix completion procedure by A. Ohsuga & K. Sakai |
| title_short | Complete E-unification based on an extension of the Knuth-Bendix completion procedure |
| title_sort | complete e unification based on an extension of the knuth bendix completion procedure |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ohsugaa completeeunificationbasedonanextensionoftheknuthbendixcompletionprocedure AT sakaiko completeeunificationbasedonanextensionoftheknuthbendixcompletionprocedure |