{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:17Z","timestamp":1725664817958},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:41Z","timestamp":1330292441000},"page":"93-107","source":"Crossref","is-referenced-by-count":10,"title":["On proving termination by innermost termination"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"8_CR1","first-page":"89","volume-title":"Lecture Notes in Computer Science 968","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz. Hierarchical termination. In N. Dershowitz and N. Lindenstrauss, editors, Proc. of 4th Int. Workshop on Conditional and Typed Rewriting Systems, Jerusalem, Israel (1994), Lecture Notes in Computer Science 968, pages 89\u2013105. Springer-Verlag, 1995."},{"issue":"2","key":"8_CR2","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 and C. Hoot. Natural termination. Theoretical Computer Science, 142(2):179\u2013207, May 1995.","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Formal models and semantics, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243\u2013320. Elsevier-The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"8_CR4","unstructured":"O. Geupel. Overlap closures and termination of term rewriting systems. Technical Report MIP-8922, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Passau, July 1989."},{"key":"8_CR5","doi-asserted-by":"crossref","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. Applicable Algebra in Engineering, Communication and Computing, 5:131\u2013158, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"8_CR6","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. Special issue on term rewriting systems, ed. D. A. Plaisted. (A preliminary version of this paper appeared as \u2018Relating innermost, weak, uniform and modular termination of term rewriting systems\u2019 in Proc. LPAR'92, LNAI 624, pages 285\u2013296, see also SEKI-Report SR-93-09, FB Informatik, Univ. Kaiserslautern).","journal-title":"Fundamenta Informaticae"},{"key":"8_CR7","unstructured":"B. Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, Jan. 1996."},{"issue":"6","key":"8_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0747-7171(88)80019-1","volume":"1988","author":"D. Kapur","year":"1988","unstructured":"D. Kapur, D. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Journal of Symbolic Computation, 1988(6):19\u201336, 1988.","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR9","first-page":"2","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 2\u2013117. Clarendon Press, Oxford, 1992."},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M. K. Rao","year":"1995","unstructured":"M. Krishna Rao. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science, 151(2):487\u2013512, Nov. 1995.","journal-title":"Theoretical Computer Science"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(92)90015-8","volume":"103","author":"M. Kurihara","year":"1992","unstructured":"M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103:273\u2013282, 1992.","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","volume-title":"PhD thesis","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Free University, Amsterdam, 1990."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/jsco.1993.1024","volume":"15","author":"A. Middeldorp","year":"1993","unstructured":"A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. Journal of Symbolic Computation, 15:331\u2013348, Sept. 1993.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"8_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. Newman","year":"1942","unstructured":"M. Newman. On theories with a combinatorial definition of equivalence. Annals of Mathematics, 43(2):223\u2013242, 1942.","journal-title":"Annals of Mathematics"},{"key":"8_CR15","unstructured":"E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universit\u00e4t Bielefeld, 1994. Report 94-01."},{"key":"8_CR16","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. Theoretical Computer Science, 136:333\u2013360, 1994.","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","series-title":"volume 1 of Handbooks of Logic in Computer Science and of Logic in Artificial Intelligence and Logic Programming","first-page":"273","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming \u2014 Logical Foundations","author":"D. A. Plaisted","year":"1994","unstructured":"D. A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming \u2014 Logical Foundations, volume 1 of Handbooks of Logic in Computer Science and of Logic in Artificial Intelligence and Logic Programming, pages 273\u2013364. Clarendon Press, Oxford, 1994."},{"issue":"2","key":"8_CR18","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, and S. Panitz. Modular termination of r-consistent and left-linear, term rewriting systems. Theoretical Computer Science, 149(2):361\u2013374, Oct. 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128\u2013143, 1987.","journal-title":"Journal of the ACM"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Y. Toyama, J. Klop, and H. Barendregt. Termination for the direct sum of left-linear term rewriting systems. In N. Dershowitz, editor, Proc. 3rd Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science 355, pages 477\u2013491. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_127"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:09Z","timestamp":1619573529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}