Associative matching for linear terms:
Abstract: "Associative matching is a feature supported by current algebraic specification languages. Deciding the existence of a match modulo associativity is known to be NP-complete in general. We show that for a linear pattern term p and a subject term s the associative matching problem can b...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,24 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Associative matching is a feature supported by current algebraic specification languages. Deciding the existence of a match modulo associativity is known to be NP-complete in general. We show that for a linear pattern term p and a subject term s the associative matching problem can be decided in [formula] time. Our main result is a new algorithm that for linear p computes the complete set [M bar] of flattened matching substitutions in [formula] time." |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008740 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27670682 | ||
| 035 | |a (DE-599)BVBBV009008740 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Eker, S. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Associative matching for linear terms |c S. M. Eker |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,24 | |
| 520 | 3 | |a Abstract: "Associative matching is a feature supported by current algebraic specification languages. Deciding the existence of a match modulo associativity is known to be NP-complete in general. We show that for a linear pattern term p and a subject term s the associative matching problem can be decided in [formula] time. Our main result is a new algorithm that for linear p computes the complete set [M bar] of flattened matching substitutions in [formula] time." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,24 |w (DE-604)BV008928356 |9 92,24 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955227 | ||
Datensatz im Suchindex
| _version_ | 1804123355871182848 |
|---|---|
| any_adam_object | |
| author | Eker, S. M. |
| author_facet | Eker, S. M. |
| author_role | aut |
| author_sort | Eker, S. M. |
| author_variant | s m e sm sme |
| building | Verbundindex |
| bvnumber | BV009008740 |
| ctrlnum | (OCoLC)27670682 (DE-599)BVBBV009008740 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01418nam a2200289 cb4500</leader><controlfield tag="001">BV009008740</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27670682</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008740</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Eker, S. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Associative matching for linear terms</subfield><subfield code="c">S. M. Eker</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,24</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Associative matching is a feature supported by current algebraic specification languages. Deciding the existence of a match modulo associativity is known to be NP-complete in general. We show that for a linear pattern term p and a subject term s the associative matching problem can be decided in [formula] time. Our main result is a new algorithm that for linear p computes the complete set [M bar] of flattened matching substitutions in [formula] time."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,24</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,24</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955227</subfield></datafield></record></collection> |
| id | DE-604.BV009008740 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955227 |
| oclc_num | 27670682 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 26 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Eker, S. M. Verfasser aut Associative matching for linear terms S. M. Eker Amsterdam 1992 26 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,24 Abstract: "Associative matching is a feature supported by current algebraic specification languages. Deciding the existence of a match modulo associativity is known to be NP-complete in general. We show that for a linear pattern term p and a subject term s the associative matching problem can be decided in [formula] time. Our main result is a new algorithm that for linear p computes the complete set [M bar] of flattened matching substitutions in [formula] time." Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,24 (DE-604)BV008928356 92,24 |
| spellingShingle | Eker, S. M. Associative matching for linear terms Rewriting systems (Computer science) |
| title | Associative matching for linear terms |
| title_auth | Associative matching for linear terms |
| title_exact_search | Associative matching for linear terms |
| title_full | Associative matching for linear terms S. M. Eker |
| title_fullStr | Associative matching for linear terms S. M. Eker |
| title_full_unstemmed | Associative matching for linear terms S. M. Eker |
| title_short | Associative matching for linear terms |
| title_sort | associative matching for linear terms |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ekersm associativematchingforlinearterms |