Partial unification over records:
Abstract: "This paper introduces a domain of infinite trees for linguistic information. An infinite tree is an extension of a list of attribute-value pairs or a directed acyclic graph. A tree is supposed to be arity-free. The main results of this paper are that (1) a theory of partial unificati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
454 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper introduces a domain of infinite trees for linguistic information. An infinite tree is an extension of a list of attribute-value pairs or a directed acyclic graph. A tree is supposed to be arity-free. The main results of this paper are that (1) a theory of partial unification is presented, (2) a solution of partial equality is defined over the domain, and (3) the equivalence between partial unifiability and solvability is established. Based on these results, a class of Horn clause programs is introduced and is given both a maximal semantics and an operational SLD semantics over the domain. Soundness and completeness are obtained with respect to the two semantics. Furthermore, as just a contraposition of it, soundness and completeness of the negation as failure rule are obtained." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010947106 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960912s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22471174 | ||
| 035 | |a (DE-599)BVBBV010947106 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Mukai, Kuniaki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Partial unification over records |c by K. Mukai |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 16 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 454 | |
| 520 | 3 | |a Abstract: "This paper introduces a domain of infinite trees for linguistic information. An infinite tree is an extension of a list of attribute-value pairs or a directed acyclic graph. A tree is supposed to be arity-free. The main results of this paper are that (1) a theory of partial unification is presented, (2) a solution of partial equality is defined over the domain, and (3) the equivalence between partial unifiability and solvability is established. Based on these results, a class of Horn clause programs is introduced and is given both a maximal semantics and an operational SLD semantics over the domain. Soundness and completeness are obtained with respect to the two semantics. Furthermore, as just a contraposition of it, soundness and completeness of the negation as failure rule are obtained." | |
| 650 | 4 | |a Computational linguistics | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 454 |w (DE-604)BV010923438 |9 454 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007321332 | ||
Datensatz im Suchindex
| _version_ | 1804125433732530176 |
|---|---|
| any_adam_object | |
| author | Mukai, Kuniaki |
| author_facet | Mukai, Kuniaki |
| author_role | aut |
| author_sort | Mukai, Kuniaki |
| author_variant | k m km |
| building | Verbundindex |
| bvnumber | BV010947106 |
| ctrlnum | (OCoLC)22471174 (DE-599)BVBBV010947106 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01717nam a2200289 cb4500</leader><controlfield tag="001">BV010947106</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22471174</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010947106</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">Mukai, Kuniaki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Partial unification over records</subfield><subfield code="c">by K. Mukai</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">454</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper introduces a domain of infinite trees for linguistic information. An infinite tree is an extension of a list of attribute-value pairs or a directed acyclic graph. A tree is supposed to be arity-free. The main results of this paper are that (1) a theory of partial unification is presented, (2) a solution of partial equality is defined over the domain, and (3) the equivalence between partial unifiability and solvability is established. Based on these results, a class of Horn clause programs is introduced and is given both a maximal semantics and an operational SLD semantics over the domain. Soundness and completeness are obtained with respect to the two semantics. Furthermore, as just a contraposition of it, soundness and completeness of the negation as failure rule are obtained."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational linguistics</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">454</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">454</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321332</subfield></datafield></record></collection> |
| id | DE-604.BV010947106 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321332 |
| oclc_num | 22471174 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 | Mukai, Kuniaki Verfasser aut Partial unification over records by K. Mukai Tokyo, Japan 1989 16 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 454 Abstract: "This paper introduces a domain of infinite trees for linguistic information. An infinite tree is an extension of a list of attribute-value pairs or a directed acyclic graph. A tree is supposed to be arity-free. The main results of this paper are that (1) a theory of partial unification is presented, (2) a solution of partial equality is defined over the domain, and (3) the equivalence between partial unifiability and solvability is established. Based on these results, a class of Horn clause programs is introduced and is given both a maximal semantics and an operational SLD semantics over the domain. Soundness and completeness are obtained with respect to the two semantics. Furthermore, as just a contraposition of it, soundness and completeness of the negation as failure rule are obtained." Computational linguistics Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 454 (DE-604)BV010923438 454 |
| spellingShingle | Mukai, Kuniaki Partial unification over records Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Computational linguistics |
| title | Partial unification over records |
| title_auth | Partial unification over records |
| title_exact_search | Partial unification over records |
| title_full | Partial unification over records by K. Mukai |
| title_fullStr | Partial unification over records by K. Mukai |
| title_full_unstemmed | Partial unification over records by K. Mukai |
| title_short | Partial unification over records |
| title_sort | partial unification over records |
| topic | Computational linguistics |
| topic_facet | Computational linguistics |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT mukaikuniaki partialunificationoverrecords |