{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:16Z","timestamp":1725495736322},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052373","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"226-240","source":"Crossref","is-referenced-by-count":12,"title":["Modularity of termination using dependency pairs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Arts","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"18_CR1","first-page":"63","volume":"1103","author":"T. Arts","year":"1996","unstructured":"T. Arts & J. Giesl, Termination of constructor systems. In Proc. RTA-96, LNCS 1103, pp. 63\u201377, New Brunswick, NJ, 1996.","journal-title":"LNCS"},{"key":"18_CR2","first-page":"261","volume":"1214","author":"T. Arts","year":"1997","unstructured":"T. Arts & J. Giesl, Automatically proving termination where simplification orderings fail. TAPSOFT '97, LNCS 1214, pp. 261\u2013273, Lille, France, 1997.","journal-title":"LNCS"},{"key":"18_CR3","first-page":"157","volume":"1232","author":"T. Arts","year":"1997","unstructured":"T. Arts & J. Giesl, Proving innermost normalisation automatically. In Proc. RTA-97, LNCS 1232, pp. 157\u2013172, Sitges, Spain, 1997.","journal-title":"LNCS"},{"key":"18_CR4","unstructured":"T. Arts & J. Giesl, Modularity of termination using dependency pairs. Tech. Rep. IBN 97\/45, TU Darmstadt, 1997. http:\/\/www.inferenzsysteme. informatik.tu-darmstadt.de\/~reports\/notes\/ibn-97-45.ps"},{"key":"18_CR5","first-page":"196","volume":"1059","author":"T. Arts","year":"1996","unstructured":"T. Arts, Termination by absence of infinite chains of dependency pairs. In Proc. CAAP '96, LNCS 1059, pp. 196\u2013210, Link\u00f6ping, Sweden, 1996.","journal-title":"LNCS"},{"key":"18_CR6","volume-title":"PhD Thesis","author":"T. Arts","year":"1997","unstructured":"T. Arts, Automatically proving termination and innermost normalisation of term rewriting systems. PhD Thesis, Utrecht Univ., The Netherlands, 1997."},{"key":"18_CR7","first-page":"69","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of rewriting. JSC, 3:69\u2013116, 1987.","journal-title":"JSC"},{"key":"18_CR8","first-page":"89","volume":"968","author":"N. Dershowitz","year":"1994","unstructured":"N. Dershowitz, Hierarchical Termination. In Proc. CTRS-94, LNCS 968, pp. 89\u2013105, Jerusalem, Israel, 1994.","journal-title":"LNCS"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz & C. Hoot, Natural termination. TCS, 142(2):179\u2013207, 1995.","journal-title":"TCS"},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74769-4","volume-title":"Termersetzungssysteme","author":"K. Drosten","year":"1989","unstructured":"K. Drosten, Termersetzungssysteme. Springer, Berlin, 1989."},{"key":"18_CR11","first-page":"255","volume":"906","author":"M. Fernandez","year":"1995","unstructured":"M. Fernandez & J.-P. Jouannaud, Modular termination of term rewriting systems revisited. In Proc. 10th Workshop on Specification of Abstract Data Types, LNCS 906, pp. 255\u2013273, S. Maxgherita, Italy, 1995.","journal-title":"LNCS"},{"key":"18_CR12","first-page":"426","volume":"914","author":"J. Giesl","year":"1995","unstructured":"J. Giesl, Generating polynomial orderings for termination proofs. In Proc. RTA-95, LNCS 914, pp. 426\u2013431, Kaiserslautern, Germany, 1995.","journal-title":"LNCS"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"B. Gramlich, Generalized sufficient conditions for modular termination of rewriting. Appl. Algebra in Engineering, Comm. & Comp., 5:131\u2013158, 1994.","journal-title":"Appl. Algebra in Engineering, Comm. & Comp."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"B. Gramlich, Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3\u201323, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"18_CR15","volume-title":"PhD Thesis","author":"B. Gramlich","year":"1996","unstructured":"B. Gramlich, Termination and confluence properties of structured rewrite systems. PhD Thesis, Universit\u00e4t Kaiserslautern, Germany, 1996."},{"key":"18_CR16","first-page":"93","volume":"1103","author":"B. Gramlich","year":"1996","unstructured":"B. Gramlich, On proving termination by innermost termination. In Proc. RTA-96, LNCS 1103, pp. 93\u2013107, New Brunswick, NJ, 1996.","journal-title":"LNCS"},{"key":"18_CR17","volume-title":"Technical Report 283","author":"G. Huet","year":"1978","unstructured":"G. Huet & D. Lankford, On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Le Chesnay, France, 1978."},{"key":"18_CR18","volume-title":"Two generalizations of the recursive path ordering","author":"S. Kamin","year":"1980","unstructured":"S. Kamin & J.-J. Levy, Two generalizations of the recursive path ordering. Department of Computer Science, University of Illinois, IL, 1980."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M. R. K. K. Rao","year":"1995","unstructured":"M. R. K. Krishna Rao, Modular proofs for completeness of hierarchical term rewriting systems. TCS, 151:487\u2013512, 1995.","journal-title":"TCS"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(92)90015-8","volume":"103","author":"M. Kurihara","year":"1992","unstructured":"M. Kurihara & A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors. TCS, 103:273\u2013282, 1992.","journal-title":"TCS"},{"key":"18_CR21","volume-title":"Technical Report Memo MTP-3","author":"D. S. Lankford","year":"1979","unstructured":"D. S. Lankford, On proving term rewriting systems are noetherian. Technical Report Memo MTP-3, Louisiana Tech. University, Ruston, LA, 1979."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"A. Middeldorp, A sufficient condition for the termination of the direct sum of term rewriting systems. LICS '89, pp. 396\u2013401, Pacific Grove, CA, 1989.","DOI":"10.1109\/LICS.1989.39194"},{"key":"18_CR23","volume-title":"PhD Thesis","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp, Modular properties of term rewriting systems. PhD Thesis, Free University Amsterdam, The Netherlands, 1990."},{"key":"18_CR24","first-page":"331","volume":"15","author":"A. Middeldorp","year":"1993","unstructured":"A. Middeldorp & Y. Toyama, Completeness of combinations of constructor systems. JSC, 15:331\u2013348, 1993.","journal-title":"JSC"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","volume":"175","author":"A. Middeldorp","year":"1997","unstructured":"A. Middeldorp & H. Zantema, Simple termination of rewrite systems. TCS, 175:127\u2013158, 1997.","journal-title":"TCS"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00039-L","volume":"136","author":"E. Ohlebusch","year":"1994","unstructured":"E. Ohlebusch, On the modularity of termination of term rewriting systems. TCS, 136:333\u2013360, 1994.","journal-title":"TCS"},{"key":"18_CR27","first-page":"1","volume":"1","author":"E. Ohlebusch","year":"1995","unstructured":"E. Ohlebusch, Modular properties of composable term rewriting systems. JSC, 1:1\u201342, 1995.","journal-title":"JSC"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","volume":"26","author":"M. Rusinowitch","year":"1987","unstructured":"M. Rusinowitch, On termination of the direct sum of term-rewriting systems. Information Processing Letters, 26:65\u201370, 1987.","journal-title":"Information Processing Letters"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(95)00080-G","volume":"149","author":"M. Schmidt-Schau\u00df","year":"1995","unstructured":"M. Schmidt-Schau\u00df, M. Marchiori, & S. E. Panitz, Modular termination of r-consistent and left-linear term rewriting systems. TCS, 149:361\u2013374, 1995.","journal-title":"TCS"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(94)90032-9","volume":"49","author":"J. Steinbach","year":"1994","unstructured":"J. Steinbach, Generating polynomial orderings. Information Processing Letters, 49:85\u201393, 1994.","journal-title":"Information Processing Letters"},{"key":"18_CR31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach, Simplification orderings: history of results. Fundamenta Informaticae, 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"18_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama, Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141\u2013143, 1987.","journal-title":"Information Processing Letters"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1145\/227683.227689","volume":"42","author":"Y. Toyama","year":"1995","unstructured":"Y. Toyama, J. W. Klop, & H. P. Barendregt, Termination for direct sums of left-linear complete term rewriting systems. J. ACM, 42:1275\u20131304, 1995.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T05:13:40Z","timestamp":1586927620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0052373","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}