{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:43:20Z","timestamp":1749728600758},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089171"},{"type":"electronic","value":"9783319089188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_33","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"476-490","source":"Crossref","is-referenced-by-count":5,"title":["Termination of Cycle Rewriting"],"prefix":"10.1007","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. J. Sander","family":"Bruggink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bruggink, H.J.S., K\u00f6nig, B., Zantema, H.: Termination analysis for graph transformation systems (submitted, 2014), http:\/\/www.ti.inf.uni-due.de\/fileadmin\/public\/bruggink\/gtst.pdf","DOI":"10.1007\/978-3-662-44602-7_15"},{"issue":"3\/4","key":"33_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"33_CR3","unstructured":"Endrullis, J., Hofbauer, D., Waldmann, J.: Decomposing Terminating Rewrite Relations. In: Proc. Workshop on Termination (WST 2006), pp. 39\u201343 (2006)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. Journal of Automated Reasoning\u00a040, 195\u2013220 (2008)","journal-title":"Journal of Automated Reasoning"},{"issue":"3-4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing\u00a015(3-4), 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"33_CR6","unstructured":"Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. Rapport Laboria 283. INRIA (1978)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Koprowski, A., Waldmann, J.: Arctic termination ... below zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 202\u2013216. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-70590-1_14"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0017135","volume-title":"Mathematical Foundations of Computer Science 1988","author":"I. Simon","year":"1988","unstructured":"Simon, I.: Recognizable sets with multiplicities in the tropical semiring. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol.\u00a0324, pp. 107\u2013120. Springer, Heidelberg (1988)"},{"key":"33_CR9","unstructured":"Zankl, H., Korp, M.: Modular complexity analysis via relative complexity. In: Proceedings of the 21st Conference on Rewriting Techniques and Applications (RTA). Lipics, pp. 385\u2013400 (2010)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10817-005-6545-0","volume":"34","author":"H. Zantema","year":"2004","unstructured":"Zantema, H.: Termination of string rewriting proved automatically. Journal of Automated Reasoning\u00a034, 105\u2013139 (2004)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T08:55:13Z","timestamp":1649580913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}