{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:58Z","timestamp":1762458898736,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642225307"},{"type":"electronic","value":"9783642225314"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22531-4_9","type":"book-chapter","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T23:34:11Z","timestamp":1310600051000},"page":"138-155","source":"Crossref","is-referenced-by-count":6,"title":["On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs"],"prefix":"10.1007","author":[{"given":"Tsubasa","family":"Sakata","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[]},{"given":"Toshiki","family":"Sakabe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/jsco.2002.0549","volume":"34","author":"A. Armando","year":"2002","unstructured":"Armando, A., Rusinowitch, M., Stratulat, S.: Incorporating decision procedures in implicit induction. J. Symb. Comput.\u00a034(4), 241\u2013258 (2002)","journal-title":"J. Symb. Comput."},{"issue":"1-2","key":"9_CR2","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. Theor. Comput. Sci.\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, United Kingdom (1998)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-73147-4_2","volume-title":"Rewriting, Computation and Proof","author":"C. Borralleras","year":"2007","unstructured":"Borralleras, C., Rubio, A.: Orderings and constraints: Theory and practice of proving termination. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds.) Jouannaud Festschrift. LNCS, vol.\u00a04600, pp. 28\u201343. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00881856","volume":"14","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning\u00a014(2), 189\u2013235 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR6","unstructured":"Bouhoula, A., Jacquemard, F.: Automated induction for complex data structures. In: CoRR, abs\/0811.4720 (2008)"},{"key":"9_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-540-71070-7_44","volume-title":"Automated Reasoning","author":"A. Bouhoula","year":"2008","unstructured":"Bouhoula, A., Jacquemard, F.: Automated induction with constrained tree automata. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 539\u2013554. Springer, Heidelberg (2008)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-55719-9_91","volume-title":"Automata, Languages and Programming","author":"H. Comon","year":"1992","unstructured":"Comon, H.: Completion of rewrite systems with membership constraints. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 392\u2013403. Springer, Heidelberg (1992)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1006\/jsco.1997.0185","volume":"25","author":"H. Comon","year":"1998","unstructured":"Comon, H.: Completion of rewrite systems with membership constraints. part I: Deduction rules. J. Symb. Comput.\u00a025(4), 397\u2013419 (1998)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jsco.1997.0186","volume":"25","author":"H. Comon","year":"1998","unstructured":"Comon, H.: Completion of rewrite systems with membership constraints. part II: Constraint solving. J. Symb. Comput.\u00a025(4), 421\u2013453 (1998)","journal-title":"J. Symb. Comput."},{"key":"9_CR11","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                    \n                    \n                   (release October 12, 2007)"},{"key":"9_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11916277_4","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Falke","year":"2006","unstructured":"Falke, S., Kapur, D.: Inductive decidability using implicit induction. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 45\u201359. Springer, Heidelberg (2006)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-70590-1_7","volume-title":"Rewriting Techniques and Applications","author":"S. Falke","year":"2008","unstructured":"Falke, S., Kapur, D.: Dependency pairs for rewriting with built-in numbers and semantic data structures. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 94\u2013109. Springer, Heidelberg (2008)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-02959-2_22","volume-title":"Automated Deduction \u2013 CADE-22","author":"S. Falke","year":"2009","unstructured":"Falke, S., Kapur, D.: A term rewriting approach to the automated termination analysis of imperative programs. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol.\u00a05663, pp. 277\u2013293. Springer, Heidelberg (2009)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-70590-1_8","volume-title":"Rewriting Techniques and Applications","author":"C. Fuhs","year":"2008","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 110\u2013125. Springer, Heidelberg (2008)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-02348-4_3","volume-title":"Rewriting Techniques and Applications","author":"C. Fuhs","year":"2009","unstructured":"Fuhs, C., Giesl, J., Pl\u00fccker, M., Schneider-Kamp, P., Falke, S.: Proving termination of integer term rewriting. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 32\u201347. Springer, Heidelberg (2009)"},{"issue":"2","key":"9_CR17","first-page":"100","volume":"1","author":"Y. Furuichi","year":"2008","unstructured":"Furuichi, Y., Nishida, N., Sakai, M., Kusakari, K., Sakabe, T.: Approach to procedural-program verification based on implicit induction of constrained term rewriting systems. IPSJ Trans. on Prog.\u00a01(2), 100\u2013121 (2008) (in Japanese)","journal-title":"IPSJ Trans. on Prog."},{"key":"9_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11814771_24","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"key":"9_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"9_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-73595-3_33","volume-title":"Automated Deduction \u2013 CADE-21","author":"J. Giesl","year":"2007","unstructured":"Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 443\u2013459. Springer, Heidelberg (2007)"},{"key":"9_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-45085-6_4","volume-title":"Automated Deduction \u2013 CADE-19","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003)"},{"issue":"4","key":"9_CR22","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. Inf. Comput.\u00a0205(4), 474\u2013511 (2007)","journal-title":"Inf. Comput."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-56393-8_31","volume-title":"Conditional Term Rewriting Systems","author":"C. Hoot","year":"1993","unstructured":"Hoot, C.: Completion for constrained term rewriting systems. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol.\u00a0656, pp. 408\u2013423. Springer, Heidelberg (1993)"},{"key":"9_CR24","volume-title":"Logic in Computer Science: Modelling and Reasoning about Systems","author":"M. Huth","year":"2000","unstructured":"Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge (2000)"},{"key":"9_CR25","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)"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(94)00274-6","volume":"142","author":"C. Lynch","year":"1995","unstructured":"Lynch, C., Snyder, W.: Redundancy criteria for constrained completion. Theor. Comput. Sci.\u00a0142(2), 141\u2013177 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR27","unstructured":"Nishida, N., Sakai, M., Hattori, T.: On Disproving Termination of Constrained Term Rewriting Systems. In: Proc. of WST 2010, 5 pages (2010)"},{"key":"9_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)"},{"key":"9_CR29","unstructured":"Sakata, T., Nishida, N., Sakabe, T.: On proving termination of constrained term rewriting systems by eliminating edges from dependency graphs. The Full Version of this Paper, \n                    \n                      http:\/\/www.trs.cm.is.nagoya-u.ac.jp\/~nishida\/wflp11\/"},{"issue":"2","key":"9_CR30","first-page":"80","volume":"2","author":"T. Sakata","year":"2009","unstructured":"Sakata, T., Nishida, N., Sakabe, T., Sakai, M., Kusakari, K.: Rewriting induction for constrained term rewriting systems. IPSJ Trans. on Prog.\u00a02(2), 80\u201396 (2009) (in Japanese)","journal-title":"IPSJ Trans. on Prog."},{"key":"9_CR31","unstructured":"Thieman, R.: The DP Framework for Proving Termination of Term Rewriting. PhD thesis, RWTH Aachen University, Germany (October 2007)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-19242-5_17","volume-title":"Conditional Term Rewriting Systems","author":"Y. Toyama","year":"1988","unstructured":"Toyama, Y.: Confluent term rewriting systems with membership conditions. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol.\u00a0308, pp. 228\u2013241. Springer, Heidelberg (1988)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-56393-8_29","volume-title":"Conditional Term Rewriting Systems","author":"J. Yamada","year":"1993","unstructured":"Yamada, J.: Confluence of terminating membership conditional TRS. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol.\u00a0656, pp. 378\u2013392. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22531-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T22:17:41Z","timestamp":1553897861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22531-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642225307","9783642225314"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22531-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}