{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:48Z","timestamp":1760202528313},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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\/bfb0052369","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"166-180","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms and reductions for rewriting problems"],"prefix":"10.1007","author":[{"given":"Rakesh M.","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rusinowitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Lugiez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF00271645","volume":"21","author":"G. Bauer","year":"1984","unstructured":"G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21:521\u2013540, 1984.","journal-title":"Acta Informatica"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"R. Book and F. Otto. String Rewriting Systems Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of finite ground term rewrite systems. Info. & Comp., 88:187\u2013201, 1990.","journal-title":"Info. & Comp."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. LICS, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume 2, chapter 6. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-50939-9_135","volume":"351","author":"A. Deruyver","year":"1989","unstructured":"A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In Lecture Notes in Computer Science, volume 351, pages 227\u2013243, 1989.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"P.J. Downey, R. Sethi, and R.E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758\u2013771, 1980.","journal-title":"Journal of the ACM"},{"key":"14_CR8","unstructured":"D.F. Escrig and C. Johnen. Decidability of home space property. Tech. Rep. 503, LRI, Universit\u00e9 de Paris Sud (Fr.), July 1989."},{"key":"14_CR9","unstructured":"J.W. Klop. Rewrite systems. In H'book of Logic in Computer Science. Oxford, 1992."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"D. Kozen. Complexity of finitely presented algebras. In Proc. Ninth ACM Symposium on Theory of Computing, pages 164\u2013177, 1977.","DOI":"10.1145\/800105.803406"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"P. Narendran and F. Otto. The word matching problem is undecidable for finite special confluent string rewriting systems. In Proc. ICALP, 1997.","DOI":"10.1007\/3-540-63165-8_218"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E. W. Mayr","year":"1982","unstructured":"E. W. Mayr and A. R. Meyer. The complexity of the word problem for commutative semigroups and polynomial ideals. Adv. in Mathematics, 46:305\u2013329, 1982.","journal-title":"Adv. in Mathematics"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"G. Nelson and D.C. Oppen. Fast decision algorithms based on congruence closure. Journal of the ACM, 27:356\u2013364, 1980. Also in the 18th IEEE FOCS, 1977.","journal-title":"Journal of the ACM"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0304-3975(87)90100-9","volume":"49","author":"M. Oyamaguchi","year":"1987","unstructured":"M. Oyamaguchi. The church rosser property for ground term rewriting systems is decidable. Theoretical Computer Science, 49:43\u201379, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"14_CR15","first-page":"347","volume":"13","author":"M. Oyamaguchi","year":"1990","unstructured":"M. Oyamaguchi. The reachability and joinability problems for right-ground term rewriting systems. Journal of Information Processing, 13(3):347\u2013354, 1990.","journal-title":"Journal of Information Processing"},{"key":"14_CR16","unstructured":"M. Oyamaguchi. On the word problem for right-ground term-rewriting systems. Trans. IEICE Japam E73, 1990."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"D.A. Plaisted. Polynomial time termination and constraint satisfaction tests. In Proc. Conf. on Rewriting Techniques & Applications, 1993.","DOI":"10.1007\/3-540-56868-9_30"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:33:42Z","timestamp":1555655622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0052369","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}