{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:41Z","timestamp":1725663521789},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:46Z","timestamp":1330254526000},"page":"128-142","source":"Crossref","is-referenced-by-count":6,"title":["Sufficient conditions for modular termination of conditional term rewriting systems"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"9_CR1","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"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111\u2013138, 1990.","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, M. Okada, and G. Sivakumar. Canonical conditional rewrite systems. In E. Lusk and R. Overbeek, editors, Proc. of the 9th Int. Conf. on Automated Deduction, volume 310 of Lecture Notes in Computer Science, pages 538\u2013549. Springer, 1988.","DOI":"10.1007\/BFb0012855"},{"key":"9_CR4","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":"9_CR5","volume-title":"Lecture Notes in Computer Science","author":"B. Gramlich","year":"1992","unstructured":"B. Gramlich. Generalized sufficient conditions for modular termination of rewriting. In Proc. of 3rd Int. Conf. on Algebraic and Logic Programming, Pisa, Italy, Lecture Notes in Computer Science. Springer-Verlag, 1992. to appear."},{"key":"9_CR6","first-page":"285","volume-title":"volume 624 of 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 A. Voronkov, editor, Conference on Logic Programming and Automated Reasoning, St. Petersburg, volume 624 of Lecture Notes in Artificial Intelligence, pages 285\u2013296. Springer-Verlag, 1992."},{"key":"9_CR7","unstructured":"J.-P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In Proceedings of the 3rd IFIP Working Conference on Formal Description of Programming Concepts, pages 223\u2013244. North-Holland, 1986."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation, 4:295\u2013334, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR9","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":"9_CR10","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":"9_CR11","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 4 th IEEE Symposium on Logic in Computer Science, pages 396\u2013401, Pacific Grove, 1989.","DOI":"10.1109\/LICS.1989.39194"},{"key":"9_CR12","volume-title":"Technical Report CS-R8959","author":"A. Middeldorp","year":"1989","unstructured":"A. Middeldorp. Termination of disjoint unions of conditional term rewriting systems. Technical Report CS-R8959, Centre for Mathematics and Computer Science, Amsterdam, 1989."},{"key":"9_CR13","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":"9_CR14","volume-title":"Completeness of combinations of conditional constructor systems","author":"A. Middeldorp","year":"1992","unstructured":"A. Middeldorp. Completeness of combinations of conditional constructor systems. Advanced Research Laboratory, Hitachi Ltd., Hatoyama, Japan, draft version, see also this volume, February 1992."},{"key":"9_CR15","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":"9_CR16","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"},{"issue":"1","key":"9_CR17","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":"9_CR18","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","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:29Z","timestamp":1619571029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}