{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171442},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029989","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"458-467","source":"Crossref","is-referenced-by-count":6,"title":["Simplification orders for term graph rewriting"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z. M. Ariola","year":"1996","unstructured":"Zena M. Ariola and Jan Willem Klop. Equational term graph rewriting. Fundamenta Informaticae, 26:207\u2013240, 1996.","journal-title":"Fundamenta Informaticae"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0304-3975(93)90063-Y","volume":"109","author":"A. Corradini","year":"1993","unstructured":"Andrea Corradini and Francesca Rossi. Hyperedge replacement jungle rewriting for term rewriting systems and logic programming. Theoretical Computer Science, 109:7\u201348, 1993.","journal-title":"Theoretical Computer Science"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17:279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"46_CR6","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465\u2013476, 1979.","journal-title":"Communications of the ACM"},{"issue":"2","key":"46_CR7","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 3(2):326\u2013336, 1952.","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"5","key":"46_CR8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"Berthold Hoffmann and Detlef Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445\u2013472, 1991.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"R. Kennaway","year":"1994","unstructured":"Richard Kennaway, Jan Willem Klop, Ronan Sleep, and Fer-Jan de Vries. On the adequacy of term graph rewriting for simulating term rewriting. ACM Transactions on Programming Languages and Systems, 16(3):493\u2013523, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"46_CR10","unstructured":"Jan Willem Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"46_CR11","first-page":"210","volume":"95","author":"J. B. Kruskal","year":"1960","unstructured":"Joseph B. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society, 95:210\u2013225, 1960.","journal-title":"Transactions of the American Mathematical Society"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Aart Middeldorp and Hans Zantema. Simple termination revisited. In Proc. 12th International Conference on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 451\u2013465. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58156-1_33"},{"key":"46_CR13","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C. S. J. A. Nash-Williams","year":"1963","unstructured":"C. St. J. A. Nash-Williams. On well-quasi-ordering finite trees. Proceedings of the Cambridge Philosophical Society, 59:833\u2013835, 1963.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"David A. Plaisted. Equational reasoning and term rewriting systems. In Dov M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, pages 273\u2013364. Clarendon Press, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0005"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Detlef Plump. Collapsed tree rewriting: Completeness, confluence, and modularity. In Proc. Conditional Term Rewriting Systems, volume 656 of Lecture Notes in Computer Science, pages 97\u2013112. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56393-8_7"},{"key":"46_CR16","unstructured":"Detlef Plump. Evaluation of functional expressions by hypergraph rewriting. Dissertation, Universit\u00e4t Bremen, Fachbereich Mathematik und Informatik, 1993."},{"key":"46_CR17","unstructured":"Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley, 1993."},{"key":"46_CR18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"Joachim Steinbach. Simplification orderings \u2014 history of results. Fundamenta Informaticae, 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:58:22Z","timestamp":1706770702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0029989","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}