{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:22Z","timestamp":1742598622725,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593409"},{"type":"electronic","value":"9783540492375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59340-3_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:14:43Z","timestamp":1330276483000},"page":"154-169","source":"Crossref","is-referenced-by-count":0,"title":["Normalized rewriting \u2014 Application to ground completion and standard bases"],"prefix":"10.1007","author":[{"given":"Claude","family":"March\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"12_CR1","volume-title":"Solvable Cases of the Decision Problem","author":"W. Ackermann","year":"1954","unstructured":"W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954."},{"key":"12_CR2","volume-title":"PhD thesis","author":"L. Bachmair","year":"1987","unstructured":"Leo Bachmair. Proof Methods for Equational Theories. PhD thesis, University of Illinois at Urbana-Champaign, 1987."},{"issue":"2&3","key":"12_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(89)90003-0","volume":"67","author":"L. Bachmair","year":"1989","unstructured":"Leo Bachmair and Nachum Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67 (2&3):173\u2013201, October 1989.","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/1970103","volume":"70","author":"W. Boone","year":"1959","unstructured":"W. Boone. The word problem. Annals of Math., 70:207\u2013265, 1959.","journal-title":"Annals of Math."},{"key":"12_CR5","volume-title":"PhD thesis","author":"B. Buchberger","year":"1965","unstructured":"Bruno Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Ideal. PhD thesis, University of Innsbruck, Austria, 1965. (in German)."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Catherine Delor and Laurence Puel. Extension of the associative path ordering to a chain of associative-commutative symbols. In Proc. 5th Rewriting Techniques and Applications, Montr\u00e9al, LNCS 690, 1993.","DOI":"10.1007\/3-540-56868-9_29"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013309. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"12_CR8","first-page":"788","volume":"4","author":"V. A. Emili\u010dev","year":"1963","unstructured":"V. A. Emili\u010dev. On algorithmic decidability of certain mass problems in the theory of commutative semigroups. Sbirsk. Mat. \u017d, 4:788\u2013798, 1963. In russian.","journal-title":"Sbirsk. Mat. \u017d"},{"issue":"3","key":"12_CR9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2(3):326\u2013336, September 1952.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(92)90165-C","volume":"104","author":"J. Jouannaud","year":"1992","unstructured":"Jean-Pierre Jouannaud and Claude March\u00e9. Termination and completion modulo associativity, commutativity and identity. Theoretical Computer Science, 104:29\u201351, 1992.","journal-title":"Theoretical Computer Science"},{"key":"12_CR11","volume-title":"Technical Report 84CRD045","author":"A. Kandri-Rody","year":"1984","unstructured":"Abdelilah Kandri-Rody and Deepak Kapur. An algorithm for computing the Gr\u00f6bner basis of a polynomial ideal over an Euclidean ring. Technical Report 84CRD045, CRD, General Electric Company, Schenectady, New-York, December 1984."},{"key":"12_CR12","volume-title":"Proc. Eurosam 84","author":"A. Kandri-Rody","year":"1984","unstructured":"Abdelilah Kandri-Rody and Deepak Kapur. Algorithms for computing gr\u00f6bner bases of polynomial ideals over various Euclidian rings. In Proc. Eurosam 84, Cambridge, England. Springer-Verlag, 1984."},{"key":"12_CR13","unstructured":"Abdelilah Kandri-Rody and Deepak Kapur. Computing the grobner basis of an ideal in polynomial rings over the integers. In V.E. Golden and M.A. Hussain, editors, Proc. of the Thirds MACSYMA Users'Conference, July 1984."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Abdelilah Kandri-Rody, Deepak Kapur, and Franz Winkler. Knuth-Bendix procedure and Buchberger algorithm \u2014 a synthesis. In Proc. of the 20th Int. Symp. on Symbolic and Algebraic Computation, Portland, Oregon, pages 55\u201367, 1989.","DOI":"10.1145\/74540.74548"},{"key":"12_CR15","volume-title":"Constructing Gr\u00f6bner bases for a polynomial ideal","author":"D. Kapur","year":"1985","unstructured":"Deepak Kapur and Paliath Narendran. Constructing Gr\u00f6bner bases for a polynomial ideal. Presented at the workshop Combinatorial algorithms in algebraic structures at Europaische Akademie, Otzenhause, 1985."},{"key":"12_CR16","unstructured":"Claude Kirchner, editor. Unification. Academic Press, 1990."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"12_CR18","volume-title":"Research Report Memo ATP-39","author":"D. S. Lankford","year":"1977","unstructured":"Dallas S. Lankford and A. M. Ballantyne. Decision procedures for simple equational theories with commutative-associative axioms: Complete sets of commutative-associative reductions. Research Report Memo ATP-39, Department of Mathematics and Computer Science, University of Texas, Austin, Texas, USA, August 1977."},{"key":"12_CR19","volume-title":"Canonical forms in finitely presented algebras","author":"P. Chenadec Le","year":"1986","unstructured":"Philippe Le Chenadec. Canonical forms in finitely presented algebras. Pitman, London, 1986."},{"issue":"1","key":"12_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1142\/S0129054192000085","volume":"3","author":"C. March\u00e9","year":"1992","unstructured":"Claude March\u00e9. The word problem of ACD-ground theories is undecidable. International Journal of Foundations of Computer Science, 3(1):81\u201392, 1992.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"12_CR21","volume-title":"Th\u00e8se de Doctorat","author":"C. March\u00e9","year":"1993","unstructured":"Claude March\u00e9. R\u00e9\u00e9criture modulo une th\u00e9orie pr\u00e9sent\u00e9e par un syst\u00e8me convergent et d\u00e9cidabilit\u00e9 des probl\u00e8mes du mot dans certains classes de th\u00e9ories \u00e9quationnelles. Th\u00e8se de Doctorat, Universit\u00e9 de Paris-Sud, France, 1993."},{"issue":"7","key":"12_CR22","first-page":"587","volume":"55","author":"A. A. Markov","year":"1947","unstructured":"A. A. Markov. On the impossibility of certain algorithms in the theory of associative systems. Dokl. Akad. Nauk SSSR, 55(7):587\u2013590, 1947. In Russian, English translation in C.R. Acad. Sci. URSS, 55, 533\u2013586.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"12_CR23","series-title":"LNCS 488","volume-title":"Proc. 4th Rewriting Techniques and Applications","author":"P. Narendran","year":"1991","unstructured":"Paliath Narendran and Micha\u00ebl Rusinowitch. Any ground associative-commutative theory has a finite canonical system. In Ronald V. Book, editor, Proc. 4th Rewriting Techniques and Applications, LNCS 488, Como, Italy, April 1991. Springer-Verlag."},{"key":"12_CR24","first-page":"1","volume":"44","author":"P. S. Novikov","year":"1955","unstructured":"P. S. Novikov. On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov, 44:1\u2013143, 1955. in Russian.","journal-title":"Trudy Mat. Inst. Steklov"},{"issue":"2","key":"12_CR25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. E. Peterson","year":"1981","unstructured":"Gerald E. Peterson and Mark E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28(2):233\u2013264, April 1981.","journal-title":"Journal of the ACM"},{"key":"12_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","volume":"13","author":"E. L. Post","year":"1947","unstructured":"Emil L. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 13:1\u201311, 1947.","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR27","unstructured":"D. A. Smith. A basis algorithm for finitely generated Abelian groups. Maths. Algorithms, I(1), 1966."},{"issue":"1","key":"12_CR28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/S0273-0979-1982-14963-1","volume":"6","author":"J. Stillwell","year":"1982","unstructured":"John Stillwell. The word problem and the isomorphism problem for groups. Bulletin of the American Mathematical Society, 6(1):33\u201356, January 1982.","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59340-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:46:02Z","timestamp":1742597162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59340-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593409","9783540492375"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-59340-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}