{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:31:20Z","timestamp":1761611480592},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T00:00:00Z","timestamp":1524096000000},"content-version":"unspecified","delay-in-days":7809,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:p>We introduce term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing combines term graph rewriting with first-order term unification. Our main result is that this mechanism is complete for all term rewriting systems over which term graph rewriting is normalizing and confluent. This includes, in particular, all convergent term rewriting systems. Completeness means that for every solution of a given equation, term graph narrowing can find a more general solution. The general motivation for using term graphs instead of terms is to improve efficiency: sharing common subterms saves space and avoids the repetition of computations.<\/jats:p>","DOI":"10.1017\/s0960129500070122","type":"journal-article","created":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:42:44Z","timestamp":1557690164000},"page":"649-676","source":"Crossref","is-referenced-by-count":11,"title":["Term graph narrowing"],"prefix":"10.1017","volume":"6","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,4,19]]},"reference":[{"key":"S0960129500070122_ref013","unstructured":"Plump D. (1993b) Evaluation of functional expressions by hypergraph rewriting, Dissertation, Universit\u00e4t Bremen, Fachbereich Mathematik und Informatik."},{"key":"S0960129500070122_ref005","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"643","author":"Habel","year":"1992","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129500070122_ref004","first-page":"161","volume-title":"Proc. 4th Workshop on Automated Deduction","author":"Fay","year":"1979"},{"key":"S0960129500070122_ref003","volume-title":"Handbook of Theoretical Computer Science","author":"Dershowitz","year":"1990"},{"key":"S0960129500070122_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57787-4_8"},{"key":"S0960129500070122_ref001","volume-title":"Handbook of Theoretical Computer Science","author":"Apt","year":"1990"},{"key":"S0960129500070122_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58338-6_102"},{"key":"S0960129500070122_ref008","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1991250504451"},{"key":"S0960129500070122_ref012","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56393-8_7"},{"key":"S0960129500070122_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10009-1_25"},{"key":"S0960129500070122_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190830"},{"key":"S0960129500070122_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90034-5"},{"key":"S0960129500070122_ref016","volume-title":"Term Graph Rewriting: Theory and Practice","author":"Sleep","year":"1993"},{"key":"S0960129500070122_ref010","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"Klop","year":"1992"},{"key":"S0960129500070122_ref015","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61228-9_80"},{"key":"S0960129500070122_ref006","volume-title":"Proc. Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA \u201995)","volume":"2","author":"Habel","year":"1995"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500070122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:42:48Z","timestamp":1557690168000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500070122\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0960129500070122"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500070122","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}