Difference matching:
Abstract: "Difference matching is a generalization of first-order matching where terms are made identical not only by variable instantiation but also by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1991
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
556 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Difference matching is a generalization of first-order matching where terms are made identical not only by variable instantiation but also by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Difference matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We present a difference matching algorithm, its properties, several applications, and suggest extensions." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010458916 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951031s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)30863555 | ||
| 035 | |a (DE-599)BVBBV010458916 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Basin, David A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Difference matching |c David Basin ; Toby Walsh |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 556 | |
| 520 | 3 | |a Abstract: "Difference matching is a generalization of first-order matching where terms are made identical not only by variable instantiation but also by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Difference matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We present a difference matching algorithm, its properties, several applications, and suggest extensions." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Walsh, Toby |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 556 |w (DE-604)BV010450646 |9 556 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006968023 | ||
Datensatz im Suchindex
| _version_ | 1804124889805750272 |
|---|---|
| any_adam_object | |
| author | Basin, David A. Walsh, Toby |
| author_facet | Basin, David A. Walsh, Toby |
| author_role | aut aut |
| author_sort | Basin, David A. |
| author_variant | d a b da dab t w tw |
| building | Verbundindex |
| bvnumber | BV010458916 |
| ctrlnum | (OCoLC)30863555 (DE-599)BVBBV010458916 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01683nam a2200325 cb4500</leader><controlfield tag="001">BV010458916</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951031s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30863555</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010458916</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">Basin, David A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Difference matching</subfield><subfield code="c">David Basin ; Toby Walsh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">556</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Difference matching is a generalization of first-order matching where terms are made identical not only by variable instantiation but also by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Difference matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We present a difference matching algorithm, its properties, several applications, and suggest extensions."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Walsh, Toby</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">556</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">556</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006968023</subfield></datafield></record></collection> |
| id | DE-604.BV010458916 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006968023 |
| oclc_num | 30863555 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Basin, David A. Verfasser aut Difference matching David Basin ; Toby Walsh Edinburgh 1991 14 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 556 Abstract: "Difference matching is a generalization of first-order matching where terms are made identical not only by variable instantiation but also by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Difference matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We present a difference matching algorithm, its properties, several applications, and suggest extensions." Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Walsh, Toby Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 556 (DE-604)BV010450646 556 |
| spellingShingle | Basin, David A. Walsh, Toby Difference matching Applied statistics, operational research sigle Computer software sigle Automatic theorem proving |
| title | Difference matching |
| title_auth | Difference matching |
| title_exact_search | Difference matching |
| title_full | Difference matching David Basin ; Toby Walsh |
| title_fullStr | Difference matching David Basin ; Toby Walsh |
| title_full_unstemmed | Difference matching David Basin ; Toby Walsh |
| title_short | Difference matching |
| title_sort | difference matching |
| topic | Applied statistics, operational research sigle Computer software sigle Automatic theorem proving |
| topic_facet | Applied statistics, operational research Computer software Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT basindavida differencematching AT walshtoby differencematching |