{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:29Z","timestamp":1725456329550},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029947","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"37-43","source":"Crossref","is-referenced-by-count":0,"title":["When are two rewrite systems more than none?"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"4_CR1","first-page":"1","volume-title":"Formal Techniques in Artificial Intelligence: A Sourcebook","author":"J. Avenhaus","year":"1990","unstructured":"J\u00fcrgen Avenhaus and Klaus Madlener. Term rewriting and equational reasoning. In R. B. Banerji, editor, Formal Techniques in Artificial Intelligence: A Sourcebook, pages 1\u201341. Elsevier, Amsterdam, 1990."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/3-540-16780-3_76","volume-title":"Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England)","author":"L. Bachmair","year":"1986","unstructured":"Leo Bachmair and Nachum Dershowitz. Commutation, transformation, and termination. In J. H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England), volume 230 of Lecture Notes in Computer Science, pages 5\u201320, Berlin, July 1986. Springer-Verlag."},{"key":"4_CR3","series-title":"Rapport","volume-title":"Une m\u00e9thode de pr\u00e9sentation de types abstraits: Applications","author":"M. Bidoit","year":"1981","unstructured":"Michel Bidoit. Une m\u00e9thode de pr\u00e9sentation de types abstraits: Applications. PhD thesis, Universit\u00e9 de Paris-Sud, Orsay, France, June 1981. Rapport 3045"},{"key":"4_CR4","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243\u2013320. North-Holland, Amsterdam, 1990."},{"key":"4_CR5","unstructured":"Nachum Dershowitz, Maribel Fern\u00e1ndez, and Jean-Pierre Jouannaud. Modular confluence revisited: The constructor-sharing case, 1997. In preparation."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (Acre, Israel)","author":"N. Dershowitz","year":"1981","unstructured":"Nachum Dershowitz. Termination of linear rewriting systems (preliminary version). In Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (Acre, Israel), volume 115 of Lecture Notes in Computer Science, pages 448\u2013458, Berlin, July 1981. European Association of Theoretical Computer Science, Springer-Verlag."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-60381-6_6","volume-title":"Proceedings of the Fourth International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994)","author":"N. Dershowitz","year":"1995","unstructured":"Nachum Dershowitz. Hierarchical termination. In N. Dershowitz and N. Lindenstrauss, editors, Proceedings of the Fourth International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), volume 968 of Lecture Notes in Computer Science, pages 89\u2013105, Berlin, 1995. Springer-Verlag."},{"key":"4_CR8","first-page":"203","volume-title":"Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (Sitges, Spain)","author":"N. Dershowitz","year":"1997","unstructured":"Nachum Dershowitz. Innocuous constructor-sharing combinations. In H. Comon, editor, Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (Sitges, Spain), number 1232 in Lecture Notes in Computer Science, pages 203\u2013216, Berlin, June 1997. Springer-Verlag."},{"key":"4_CR9","series-title":"Informatik Fachberichte","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74769-4","volume-title":"Termersetzungssysteme","author":"K. Drosten","year":"1989","unstructured":"K. Drosten. Termersetzungssysteme. PhD thesis, Universitat Passau, Passau, Germany, 1989. Informatik Fachberichte 210, Springer-Verlag (Berlin)."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0013069","volume-title":"Proceedings of the Conference on Logic Programming and Automated Reasoning (St. Petersburg, Russia)","author":"B. Gramlich","year":"1992","unstructured":"Bernhard Gramlich. Relating innermost, weak, uniform and modular termination of term rewriting systems. In A. Voronkov, editor, Proceedings of the Conference on Logic Programming and Automated Reasoning (St. Petersburg, Russia), volume 624 of Lecture Notes in Artificial Intelligence, pages 285\u2013296, Berlin, July 1992. Springer-Verlag."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"Bernhard 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":"4_CR12","unstructured":"J. Roger Hindley. The Church-Rosser Property and a Result in Combinatory Logic. PhD thesis, 1964."},{"issue":"4","key":"4_CR13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G\u00e9rard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. of the Association for Computing Machinery, 27(4):797\u2013821, October 1980.","journal-title":"J. of the Association for Computing Machinery"},{"key":"4_CR14","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J. W. Klop","year":"1992","unstructured":"Jan Willem Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1\u2013117. Oxford University Press, Oxford, 1992."},{"key":"4_CR15","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Donald E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, Oxford, U. K., 1970. Reprinted in Automation of Reasoning 2, Springer-Verlag, Berlin, pp. 342\u2013376 (1983)."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-59200-8_43","volume-title":"Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany)","author":"M. Marchiori","year":"1995","unstructured":"Massimo Marchiori. Modularity of completeness revisited. In Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany), volume 914 of Lecture Notes in Computer Science, pages 2\u201310, Berlin, April 1995. Springer-Verlag."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/jsco.1993.1024","volume":"15","author":"A. Middeldorp","year":"1993","unstructured":"Aart Middeldorp and Yoshihito Toyama. Completeness of combinations of constructor systems. J. Symbolic Computation, 15:331\u2013348, 1993.","journal-title":"J. Symbolic Computation"},{"key":"4_CR18","first-page":"262","volume-title":"Proceedings of the Nineteenth International Colloquium on Trees in Algebra and Programming (Edinburgh, UK)","author":"E. Ohlebusch","year":"1994","unstructured":"Enno Ohlebusch. On the modularity of confluence of constructor-sharing term rewriting systems. In S. Tison, editor, Proceedings of the Nineteenth International Colloquium on Trees in Algebra and Programming (Edinburgh, UK), volume 787 of Lecture Notes in Computer Science, pages 262\u2013275, Berlin, April 1994. Springer-Verlag."},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00039-L","volume":"136","author":"E. Ohlebusch","year":"1994","unstructured":"Enno Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Computer Science, 136(2):333\u2013360, December 1994.","journal-title":"Theoretical Computer Science"},{"key":"4_CR20","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"D. A. Plaisted","year":"1993","unstructured":"David A. Plaisted. Term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, chapter 2. Oxford University Press, Oxford, 1993. To appear."},{"issue":"4","key":"4_CR21","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J. Raoult","year":"1980","unstructured":"Jean-Claude Raoult and Jean Vuillemin. Operational and semantic equivalence between recursive programs. J. of the Association for Computing Machinery, 27(4):772\u2013796, October 1980.","journal-title":"J. of the Association for Computing Machinery"},{"issue":"1","key":"4_CR22","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B. K. Rosen","year":"1973","unstructured":"Barry K. Rosen. Tree-manipulating systems and Church-Rosser theorems. J. of the Association for Computing Machinery, 20(1):160\u2013187, January 1973.","journal-title":"J. of the Association for Computing Machinery"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BFb0062861","volume-title":"Algebra and Logic: 1974 Summer Research Institute of the Australian Mathematical Society","author":"J. Staples","year":"1975","unstructured":"John Staples. Church-Rosser theorem for replacement systems. In J. N. Crossley, editor, Algebra and Logic: 1974 Summer Research Institute of the Australian Mathematical Society, volume 450 of Lecture Notes in Mathematics, pages 291\u2013307, Berlin, West Germany, 1975. Springer-Verlag."},{"issue":"6","key":"4_CR24","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1145\/227683.227689","volume":"42","author":"Y. Toyama","year":"1995","unstructured":"Yoshihito Toyama, Jan Willem Klop, and Hendrik Pieter Barendregt. Termination for direct sums of left-linear complete term rewriting systems. J. of the Association for Computing Machinery, 42(6):1275\u20131304, November 1995.","journal-title":"J. of the Association for Computing Machinery"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Yoshihito 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":"4_CR26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Yoshihito Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. J. of the Association for Computing Machinery, 34(1):128\u2013143, January 1987.","journal-title":"J. of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:14Z","timestamp":1586593334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0029947","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}