{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:39Z","timestamp":1725455919173},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013819","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"53-68","source":"Crossref","is-referenced-by-count":4,"title":["Generalized sufficient conditions for modular termination of rewriting"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0020-0190(79)90071-1","volume":"9","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz. A note on simplification orderings. Information Processing Letters, 9(5):212\u2013215, 1979.","journal-title":"Information Processing Letters"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, pages 279\u2013301, 1982.","DOI":"10.1016\/0304-3975(82)90026-3"},{"issue":"1","key":"5_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1):69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR4","volume-title":"Informatik-Fachberichte 210","author":"K. Drosten","year":"1989","unstructured":"K. Drosten. Termersetzungssysteme. Informatik-Fachberichte 210. Springer, 1989. in German."},{"key":"5_CR5","first-page":"22","volume":"31","author":"H. Ganzinger","year":"1987","unstructured":"H. Ganzinger and R. Giegerich. A note on termination in combinations of heterogeneous term rewriting systems. Bulletin of the European Association for Theoretical Computer Science, 31:22\u201328, 1987.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"5_CR6","unstructured":"B. Gramlich. A structural analysis of modular termination of term rewriting systems. SEKI Report SR-91-15, Dept. of Comp. Science, Univ. of Kaiserslautern, 1991."},{"key":"5_CR7","volume-title":"Lecture Notes in Artificial Intelligence","author":"B. Gramlich","year":"1992","unstructured":"B. Gramlich. Relating innermost, weak, uniform and modular termination of term rewriting systems. In Conference on Logic Programming and Automated Reasoning, St. Petersburg, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1992. to appear."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"B. Gramlich. Sufficient conditions for modular termination of conditional term rewriting systems (extended abstract). In Proc. of the 3rd International Workshop on Conditional Term Rewriting Systems, 1992. to appear.","DOI":"10.1007\/3-540-56393-8_9"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"G. Huet and D.C. Oppen. Equations and rewrite rules: A survey. In Ronald V. Book, editor, Formal Languages, Perspectives And Open Problems, pages 349\u2013405. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"5_CR10","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I. Oxford University Press, 1990."},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(90)90221-I","volume":"34","author":"M. Kurihara","year":"1990","unstructured":"M. Kurihara and I. Kaji. Modular term rewriting systems and the termination. Information Processing Letters, 34:1\u20134, 1990.","journal-title":"Information Processing Letters"},{"key":"5_CR12","first-page":"632","volume":"34","author":"M. Kurihara","year":"1990","unstructured":"M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems. Journal of IPS, Japan, 34:632\u2013642, 1990.","journal-title":"Journal of IPS, Japan"},{"key":"5_CR13","volume-title":"Technical Report SF-36","author":"M. Kurihara","year":"1990","unstructured":"M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Technical Report SF-36, Hokkaido University, Sapporo, 1990."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"A. Middeldorp. A sufficient condition for the termination of the direct sum of term rewriting systems. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science, pages 396\u2013401, Pacific Grove, 1989.","DOI":"10.1109\/LICS.1989.39194"},{"key":"5_CR15","volume-title":"PhD thesis","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Centre for Mathematics and Computer Science, Amsterdam, 1990."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. In R.V. Book, editor, Proc. of the 4th Int. Conf, on Rewriting Techniques and Applications, volume 488 of Lecture Notes in Computer Science, pages 174\u2013187. Springer, 1991.","DOI":"10.1007\/3-540-53904-2_96"},{"key":"5_CR17","doi-asserted-by":"crossref","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":"5_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141\u2013143, 1987.","journal-title":"Information Processing Letters"},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","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":"5_CR20","doi-asserted-by":"crossref","unstructured":"Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for the direct sum of left-linear term rewriting systems. In N. Dershowitz, editor, Proc. of the 3rd Int. Conf. on Rewriting Techniques and Applications, volume 355 of Lecture Notes in Computer Science, pages 477\u2013491. Springer, 1989.","DOI":"10.1007\/3-540-51081-8_127"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:07Z","timestamp":1586579587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0013819","relation":{},"subject":[]}}