{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:54:34Z","timestamp":1781927674565,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642287169","type":"print"},{"value":"9783642287176","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_21","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T15:13:04Z","timestamp":1331046784000},"page":"258-273","source":"Crossref","is-referenced-by-count":11,"title":["Confluence of Non-Left-Linear TRSs via Relative Termination"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Klein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nao","family":"Hirokawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"11","key":"21_CR1","first-page":"1134","volume":"3","author":"T. Aoto","year":"1997","unstructured":"Aoto, T., Toyama, Y.: Persistency of confluence. Journal of Universal Computer Science\u00a03(11), 1134\u20131147 (1997)","journal-title":"Journal of Universal Computer Science"},{"key":"21_CR2","unstructured":"Aoto, T., Toyama, Y.: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. In: Proc. 22nd RTA. LIPIcs, vol.\u00a010, pp. 91\u2013106 (2011)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-02348-4_7","volume-title":"Rewriting Techniques and Applications","author":"T. Aoto","year":"2009","unstructured":"Aoto, T., Yoshida, J., Toyama, Y.: Proving Confluence of Term Rewriting Systems Automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 93\u2013102. Springer, Heidelberg (2009)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"21_CR5","unstructured":"Felgenhauer, B., Zankl, H., Middeldorp, A.: Layer systems for proving confluence. In: Proc. 31st FSTTCS. LIPIcs, vol.\u00a013, pp. 288\u2013299 (2011)"},{"key":"21_CR6","unstructured":"Geser, A.: Relative Termination. PhD thesis, Universit\u00e4t Passau, Available as technical report 91-03 (1990)"},{"key":"21_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11559306_12","volume-title":"Frontiers of Combining Systems","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and Disproving Termination of Higher-Order Functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 216\u2013231. Springer, Heidelberg (2005)"},{"issue":"12","key":"21_CR8","first-page":"2147","volume":"37","author":"H. Gomi","year":"1996","unstructured":"Gomi, H., Oyamaguchi, M., Ohta, Y.: On the Church-Rosser property of non-E-overlapping and strongly depth-preserving term rewriting systems. Trans. IPSJ\u00a037(12), 2147\u20132160 (1996)","journal-title":"Trans. IPSJ"},{"issue":"4","key":"21_CR9","first-page":"992","volume":"39","author":"H. Gomi","year":"1998","unstructured":"Gomi, H., Oyamaguchi, M., Ohta, Y.: On the Church-Rosser property of root-E-overlapping and strongly depth-preserving term rewriting systems. Trans. IPSJ\u00a039(4), 992\u20131005 (1998)","journal-title":"Trans. IPSJ"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10817-011-9238-x","volume":"47","author":"N. Hirokawa","year":"2011","unstructured":"Hirokawa, N., Middeldorp, A.: Decreasing diagrams and relative termination. Journal of Automated Reasoning\u00a047, 481\u2013501 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027, 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-12727-5_16","volume-title":"CAAP \u201983","author":"J.P. Jouannaud","year":"1983","unstructured":"Jouannaud, J.P.: Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. In: Protasi, M., Ausiello, G. (eds.) CAAP 1983. LNCS, vol.\u00a0159, pp. 269\u2013283. Springer, Heidelberg (1983)"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR14","unstructured":"Klein, D., Hirokawa, N.: Maximal completion. In: Proc. 22nd RTA. LIPIcs, vol.\u00a010, pp. 71\u201380 (2011)"},{"key":"21_CR15","unstructured":"Klop, J.: Combinatory reduction systems. PhD thesis, Utrecht University (1980)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263\u2013297 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-02348-4_21","volume-title":"Rewriting Techniques and Applications","author":"M. Korp","year":"2009","unstructured":"Korp, M., Sternagel, C., Zankl, H., Middeldorp, A.: Tyrolean Termination Tool 2. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 295\u2013304. Springer, Heidelberg (2009)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-56279-6_84","volume-title":"Algorithms and Computation","author":"M. Ogawa","year":"1992","unstructured":"Ogawa, M.: Chew\u2019s Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol.\u00a0650, pp. 309\u2013318. Springer, Heidelberg (1992)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jsco.1995.1036","volume":"20","author":"E. Ohlebusch","year":"1995","unstructured":"Ohlebusch, E.: Modular properties of composable term rewriting systems. Journal of Symbolic Computation\u00a020, 1\u201341 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"21_CR20","unstructured":"Stump, A., Kimmell, G., Omar, R.E.H.: Type preservation as a confluence problem. In: Proc. 22nd RTA. LIPIcs, vol.\u00a010, pp. 345\u2013360 (2011)"},{"key":"21_CR21","unstructured":"TeReSe: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"issue":"1","key":"21_CR22","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM\u00a034(1), 128\u2013143 (1987)","journal-title":"Journal of the ACM"},{"key":"21_CR23","unstructured":"Toyama, Y.: Commutativity of term rewriting systems. In: Programming of Future Generation Computers II, pp. 393\u2013407. North-Holland (1988)"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00173-9","volume":"175","author":"V. Oostrom van","year":"1997","unstructured":"van Oostrom, V.: Developing developments. Theoretical Computer Science\u00a0175(1), 159\u2013181 (1997)","journal-title":"Theoretical Computer Science"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-70590-1_21","volume-title":"Rewriting Techniques and Applications","author":"V. Oostrom van","year":"2008","unstructured":"van Oostrom, V.: Confluence by Decreasing Diagrams. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 306\u2013320. Springer, Heidelberg (2008)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Logic Programming \u201988","author":"A. Yamamoto","year":"1989","unstructured":"Yamamoto, A.: Completeness of Extending Unification Based on Basic Narrowing. In: Fujisaki, T., Nakata, I., Tanaka, H. (eds.) Logic Programming 1988. LNCS, vol.\u00a0383, pp. 1\u201310. Springer, Heidelberg (1989)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-22438-6_38","volume-title":"Automated Deduction \u2013 CADE-23","author":"H. Zankl","year":"2011","unstructured":"Zankl, H., Felgenhauer, B., Middeldorp, A.: CSI \u2013 A Confluence Tool. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol.\u00a06803, pp. 499\u2013505. Springer, Heidelberg (2011)"},{"key":"21_CR28","unstructured":"Zankl, H., Felgenhauer, B., Middeldorp, A.: Labelings for decreasing diagrams. In: Proc. 22nd RTA. LIPIcs, pp. 377\u2013392 (2011)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28717-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:14Z","timestamp":1620126434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}