{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:26:58Z","timestamp":1725470818048},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_12","type":"book-chapter","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T23:47:41Z","timestamp":1347925661000},"page":"172-186","source":"Crossref","is-referenced-by-count":1,"title":["Rational Term Rewriting Revisited: Decidability and Confluence"],"prefix":"10.1007","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen","family":"Ketema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational Term Graph Rewriting. Fundamenta Informaticae\u00a026, 207\u2013240 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"12_CR3","unstructured":"Barendsen, E.: Term Graph Rewriting. In: Terese (ed.) [17], ch. 13, pp. 712\u2013743"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"A. Corradini","year":"1993","unstructured":"Corradini, A.: Term Rewriting in CT \u03a3. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 468\u2013484. Springer, Heidelberg (1993)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Corradini, A., Drewes, F.: Term Graph Rewriting and Parallel Term Rewriting. In: TERMGRAPH 2011. EPTCS, vol.\u00a048, pp. 3\u201318 (2011)","DOI":"10.4204\/EPTCS.48.3"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0053548","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Corradini","year":"1998","unstructured":"Corradini, A., Gadducci, F.: Rational Term Rewriting. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 156\u2013171. Springer, Heidelberg (1998)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental Properties of Infinite Trees. Theoretical Computer Science\u00a025(2), 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"12_CR8","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Klop, J.W., van Oostrom, V.: Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. In: RTA 2010. LIPIcs, vol.\u00a06, pp. 85\u2013102. Schloss Dagstuhl (2010)"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. Journal of the ACM\u00a024(1), 68\u201395 (1977)","journal-title":"Journal of the ACM"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-58338-6_90","volume-title":"Mathematical Foundations of Computer Science 1994","author":"P. Inverardi","year":"1994","unstructured":"Inverardi, P., Zilli, M.V.: Rational Rewriting. In: Privara, I., Ru\u017ei\u010dka, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol.\u00a0841, pp. 433\u2013442. Springer, Heidelberg (1994)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J.R. Kennaway","year":"1994","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ACM Transactions on Programming Languages and Systems\u00a016(3), 493\u2013523 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR12","unstructured":"Kennaway, R., de Vries, F.-J.: Infinitary Rewriting. In: Terese (eds.) [17], ch. 12, pp. 668\u2013711"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.-J.: Transfinite Reductions in Orthogonal Term Rewriting Systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"12_CR14","unstructured":"Ketema, J., Simonsen, J.G.: Computing with Infinite Terms and Infinite Reductions (unpublished manuscript)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-56393-8_7","volume-title":"Conditional Term Rewriting Systems","author":"D. Plump","year":"1993","unstructured":"Plump, D.: Collapsed Tree Rewriting: Completeness, Confluence, and Modularity. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol.\u00a0656, pp. 97\u2013111. Springer, Heidelberg (1993)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Plump, D.: Term Graph Rewriting. In: Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, vol.\u00a02, pp. 3\u201361. World Scientific (1999)","DOI":"10.1142\/9789812815149_0001"},{"key":"12_CR17","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer (2000)","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:17:46Z","timestamp":1620116266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}