{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T16:04:28Z","timestamp":1750089868734},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408847"},{"type":"electronic","value":"9783642408854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40885-4_22","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T07:20:19Z","timestamp":1378884019000},"page":"311-326","source":"Crossref","is-referenced-by-count":7,"title":["Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering"],"prefix":"10.1007","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Proc. of 21st RTA. LIPIcs, vol.\u00a06, pp. 7\u201316. Schloss Dagstuhl (2010)","key":"22_CR1"},{"issue":"31","key":"22_CR2","first-page":"1","volume":"1","author":"T. Aoto","year":"2012","unstructured":"Aoto, T., Toyama, Y.: A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. Logical Methods in Computer Science\u00a01(31), 1\u201329 (2012)","journal-title":"Logical Methods in Computer Science"},{"key":"22_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)"},{"issue":"1-2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","key":"22_CR5","DOI":"10.1017\/CBO9781139172752"},{"doi-asserted-by":"crossref","unstructured":"Comon, H., Godoy, G., Nieuwenhuis, R., Tiwari, A.: The confluence of ground term rewrite systems is decidable in polynomial time. In: Proc. of 42nd LICS, pp. 263\u2013297. IEEE Computer Society Press (2001)","key":"22_CR6","DOI":"10.1109\/SFCS.2001.959904"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10817-005-9022-x","volume":"34","author":"E. Contejean","year":"2005","unstructured":"Contejean, E., March\u00e9, C., Tom\u00e1s, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretation. Journal of Automated Reasoning\u00a034, 325\u2013363 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Heuillard, T., Lescanne, P., Tison, S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation\u00a088, 187\u2013201 (1990)","journal-title":"Information and Computation"},{"key":"22_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-63104-6_2","volume-title":"Automated Deduction - CADE-14","author":"I. Durand","year":"1997","unstructured":"Durand, I., Middeldorp, A.: Decidable call by need computations in term rewriting. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol.\u00a01249, pp. 4\u201318. Springer, Heidelberg (1997)"},{"unstructured":"Felgenhauer, B.: Deciding confluence of ground term rewrite systems in cubic time. In: Proc. of 23rd RTA. LIPIcs, vol.\u00a015, pp. 165\u2013175. Schloss Dagstuhl (2012)","key":"22_CR10"},{"unstructured":"Felgenhauer, B.: A proof order for decreasing diagrams. In: Proc. of 1st IWC, pp. 9\u201315 (2012)","key":"22_CR11"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Rewriting Techniques and Applications","author":"T. Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 151\u2013165. Springer, Heidelberg (1998)"},{"key":"22_CR13","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":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11538363_37","volume-title":"Computer Science Logic","author":"G. Godoy","year":"2005","unstructured":"Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 541\u2013556. Springer, Heidelberg (2005)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00200-004-0148-6","volume":"15","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Tiwari, A., Verma, R.: Characterizing confluence by rewrite closure and right ground term rewriting systems. Applicable Algebra in Engineering, Communication and Computing\u00a015, 13\u201336 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"unstructured":"Hirokawa, N., Klein, D.: Saigawa: A confluence tool. In: Proc. of 1st IWC, p. 49 (2012)","key":"22_CR17"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ic.2006.08.010","volume":"205","author":"N. Hirokawa","year":"2007","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation\u00a0205(4), 474\u2013511 (2007)","journal-title":"Information and Computation"},{"issue":"4","key":"22_CR19","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(4), 481\u2013501 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-540-31982-5_30","volume-title":"Foundations of Software Science and Computational Structures","author":"\u0141. Kaiser","year":"2005","unstructured":"Kaiser, \u0141.: Confluence of right ground term rewriting systems is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 470\u2013489. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Klein, D., Hirokawa, N.: Confluence of non-left-linear TRSs via relative termination. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol.\u00a07180, pp. 258\u2013273. Springer, Heidelberg (2012)","key":"22_CR21","DOI":"10.1007\/978-3-642-28717-6_21"},{"doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press (1970)","key":"22_CR22","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"issue":"11","key":"22_CR23","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.ic.2009.02.010","volume":"207","author":"M. Korp","year":"2009","unstructured":"Korp, M., Middeldorp, A.: Match-bounds revisited. Information and Computation\u00a0207(11), 1259\u20131283 (2009)","journal-title":"Information and Computation"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K. Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 47\u201361. Springer, Heidelberg (1999)"},{"key":"22_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-45744-5_49","volume-title":"Automated Reasoning","author":"A. Middeldorp","year":"2001","unstructured":"Middeldorp, A.: Approximating dependency graphs using tree automata techniques. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 593\u2013610. Springer, Heidelberg (2001)"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0304-3975(87)90100-9","volume":"49","author":"M. Oyamaguchi","year":"1987","unstructured":"Oyamaguchi, M.: The Church-Rosser property for ground term rewriting systems is decidable. Theoretical Computer Science\u00a049, 43\u201379 (1987)","journal-title":"Theoretical Computer Science"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2008.05.013","volume":"403","author":"\u00c9. Payet","year":"2008","unstructured":"Payet, \u00c9.: Loop detection in term rewriting using eliminating unfoldings. Theoretical Computer Science\u00a0403, 307\u2013327 (2008)","journal-title":"Theoretical Computer Science"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-53904-2_103","volume-title":"Rewriting Techniques and Applications","author":"K. Salomaa","year":"1991","unstructured":"Salomaa, K.: Decidability of confluence and termination of monadic term rewriting systems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 275\u2013286. Springer, Heidelberg (1991)"},{"unstructured":"Standard ML of New Jersey, http:\/\/www.sml.org\/","key":"22_CR29"},{"unstructured":"Terese: Term Rewriting Systems. Cambridge University Press (2003)","key":"22_CR30"},{"doi-asserted-by":"crossref","unstructured":"Toyama, Y.: Confluent term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, p. 1. Springer, Heidelberg (2005) slides are available from, http:\/\/www.nue.riec.tohoku.ac.jp\/user\/toyama\/slides\/toyama-RTA05.pdf","key":"22_CR31","DOI":"10.1007\/978-3-540-32033-3_1"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03177743","volume":"32","author":"X. Urbain","year":"2004","unstructured":"Urbain, X.: Modular & incremental automated termination proofs. Journal of Automated Reasoning\u00a032, 315\u2013355 (2004)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR33","series-title":"LNAI","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 (LNAI), vol.\u00a06803, pp. 499\u2013505. Springer, Heidelberg (2011)"},{"unstructured":"Zankl, H., Felgenhauer, B., Middeldorp, A.: Labelings for decreasing diagrams. In: Proc. of 22nd RTA. LIPIcs, vol.\u00a010, pp. 377\u2013392. Schloss Dagstuhl (2011)","key":"22_CR34"},{"key":"22_CR35","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae\u00a024, 89\u2013105 (1995)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40885-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T16:19:04Z","timestamp":1596471544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}