{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:43Z","timestamp":1725663283538},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159766"},{"type":"electronic","value":"9783540396796"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15976-2_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:25:41Z","timestamp":1330194341000},"page":"345-364","source":"Crossref","is-referenced-by-count":7,"title":["An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras"],"prefix":"10.1007","author":[{"given":"Abdelilah","family":"Kandri-Rody","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"17_CR1","unstructured":"Angarsson, S., Kandri-Rody, A., Kapur, D., Narendran, P., and Saunders, B.D., \u201cThe Complexity of Testing whether a Polynomial Ideal is Nontrivial,\u201d Proceedings of the Third MACSYMA User's Conference, Schenectady, NY, July, 1984, pp. 452\u2013458."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0898-1221(81)90115-2","volume":"7","author":"A. M. Ballantyne","year":"1981","unstructured":"Ballantyne, A.M., and Lankford, D.S., \u201cNew Decision Algorithms for Finitely Presented Commutative Semigroups,\u201d Computer and Mathematics with Applications Vol. 7 pp. 159\u2013165, 1981.","journal-title":"Computer and Mathematics with Applications"},{"key":"17_CR3","volume-title":"An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (in German)","author":"B. Buchberger","year":"1965","unstructured":"Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (in German), Ph.D. Thesis, Univ. of Innsbruck, Austria, Math., Inst., 1965."},{"key":"17_CR4","first-page":"137","volume":"171","author":"B. Buchberger","year":"1984","unstructured":"Buchberger, B., \u201cA Critical-Pair\/Completion Algorithm in Reduction Rings,\u201d Proc. Logic and Machines: Decision Problems and Complexity, (eds. by E. Borger, G. Hasenjaeger, D. Rodding), Spring LNCS 171, pp 137\u2013161, 1984.","journal-title":"Spring LNCS"},{"key":"17_CR5","series-title":"Computing Suppl.","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-7091-3406-1_2","volume-title":"Computer Algebra: Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1982","unstructured":"Buchberger, B., and Loos, R., \u201cAlgebraic Simplification,\u201d in Computer Algebra: Symbolic and Algebraic Computation (Eds. B. Buchberger, G.E. Collins and R. Loos), Computing Suppl. 4 (1982), Springer Verlag, New York, pp. 11\u201343."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0211057","volume":"11","author":"T. J. Chou","year":"1982","unstructured":"Chou, T.J., and Collins, G.E., \u201cAlgorithms for the Solutions of Systems of Linear Diophantine Equations,\u201d Siam J. Comput. 11 (1982), pp. 687\u2013708.","journal-title":"Siam J. Comput."},{"key":"17_CR7","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability, W.H. Freeman, 1979."},{"key":"17_CR8","volume-title":"Topics in Theorem Proving and Program Synthesis","author":"J. Hsiang","year":"1983","unstructured":"Hsiang, J., Topics in Theorem Proving and Program Synthesis, Ph.D. Thesis, University of Illinois, Urbana-Champagne, July 1983."},{"issue":"4","key":"17_CR9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G., \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,\u201d JACM, Vol. 27, No. 4, October 1980, pp. 797\u2013821. on Automata, Languages, and Programming (1983), Spain.","journal-title":"JACM"},{"key":"17_CR10","unstructured":"Kandri-Rody, A., and Kapur, D., \u201cComputing the Gr\u00f6bner Basis of a Polynomial Ideal over Integers,\u201d Proceedings of the Third MACSYMA Users' Conference, Schenectady, NY, July 1984, pp. 436\u2013451."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Kandri-Rody, A., and Kapur, D., \u201cAlgorithms for Computing the Gr\u00f6bner Bases of Polynomial Ideals over Various Euclidean Rings,\u201d Proceedings of the EUROSAM, '84, Cambridge, England, July 1984.","DOI":"10.1007\/BFb0032842"},{"key":"17_CR12","unstructured":"Kandri-Rody, A., and Kapur, D., \"An Algorithm for Computing the Gr\u00f6bner Basis of a Polynomial Ideal over a Euclidean Ring,\u201d General Electric Corporate Research and Development Report 84CRD045, April, 1984; Revised, December, 1984."},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"Kannan, R., and Bachem, A., \u201cProlynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix,\u201d Siam J. Comput. 8 (1979), pp. 499\u2013507.","journal-title":"Siam J. Comput."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kapur, D., and Narendran, P., \u201cAn Equational Approach to Theorem Proving in First-Order Predicate Calculus,\u201d to appear in the Proc. of the IJCAI-85, Los Angeles, August, 1985.","DOI":"10.1145\/1012497.1012521"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. and Bendix, P.B., \u201cSimple Word Problems in Universal Algebras,\u201d in Computational Problems in Abstract Algebras. (Ed. J. Leech), Pergamon Press, 1970, pp. 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"17_CR16","unstructured":"Lankford, D.S., and Ballantyne, A.M., \u201cDecision Procedures for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions,\u201d Automatic Theorem Proving Project, Dept. of Math. and Computer Science, University of Texas, Austin, TX 78712, Report ATP-39, August 1977."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Lankford, D.S., Butler, G., and Brady, B., \u201cAbelian Group Unification Algorithms for Elementary Terms,\u201d Proceedings of a NSF Workshop on the Rewrite Rule Laboratory, September 6\u20139, 1983, General Electric Report, April, 1984.","DOI":"10.1090\/conm\/029\/749246"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Lankford, D.S., Butler, G., and Ballantyne, A.M., \u201cA Progress Report on New Decision Algorithms for Finitely Presented Abelian Groups,\u201d 7th Conference on Automated Deduction, Springer Verlag LNCS 170 (ed. R.E. Shostak), NAPA Valley, Calif., May, 1984, pp. 128\u2013141.","DOI":"10.1007\/978-0-387-34768-4_8"},{"key":"17_CR19","unstructured":"Lankford, D.S, and Butler, G., \u201cOn the Foundations of Applied Equational Logic,\u201d Talk Given at General Electric Research and Development Center, Schenectady, NY, Feb., 1984."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Lauer, M., \u201cCanonical Representatives for Residue Classes of a Polynomial Ideal,\u201d SYMSAC 1976, pp. 339\u2013345.","DOI":"10.1145\/800205.806353"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Le Chenadec, P., \u201cCanonical Forms in Finitely Presented Algebras,\u201d 7th International Conf. on Automated Deduction, Springer Verlag LNCS 170 (ed. R.E. Shostak), Napa Valley, Calif, May, 1984, pp. 142\u2013165.","DOI":"10.1007\/BFb0047119"},{"key":"17_CR22","first-page":"279","volume":"191","author":"J. Matijasevitch","year":"1970","unstructured":"Matijasevitch, J., \u201cEnumerable Sets are Diophantine,\u201d Dokl. Akad. Nauk. SSSR 191 (1970), pp. 279\u2013282.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. L. Peterson","year":"1981","unstructured":"Peterson, G.L., and Stickel, M.E., \u201cComplete Sets of Reductions for Some Equational Theories,\u201d JACM 28 (1981), pp. 233\u2013264.","journal-title":"JACM"},{"key":"17_CR24","series-title":"Computer Science Tech. Report","volume-title":"Algorithmic Aspects of Polynomial Residue Class Rings","author":"S. Schaller","year":"1979","unstructured":"Schaller, S., Algorithmic Aspects of Polynomial Residue Class Rings, Ph.D. Thesis, Computer Science Tech. Report 370, University of Wisconsin, Madison, 1979."},{"key":"17_CR25","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"M. E. Stickel","year":"1980","unstructured":"Stickel, M.E., \u201cA Unification Algorithm for Associative-Commutative Functions,\u201d JACM 28 (1980), pp. 423\u2013434.","journal-title":"JACM"},{"key":"17_CR26","first-page":"203","volume":"XLI","author":"W. Szmielew","year":"1954","unstructured":"Szmielew, W., \u201cElementary Properties of Abelian Groups,\u201d Fund. Math. XLI (1954), pp. 203\u2013271.","journal-title":"Fund. Math."},{"key":"17_CR27","volume-title":"Modern Algebra, Vols. I and II","author":"B. L. Waerden van der","year":"1966","unstructured":"van der Waerden, B.L., Modern Algebra, Vols. I and II, Fredrick Ungar Publishing Co., New York, 1966."},{"key":"17_CR28","unstructured":"Zacharias, G., Generalized Grobner Bases in Commutative Polynomial Rings, Bachelor Thesis, Lab. for Computer Science, MIT, 1978."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15976-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:03Z","timestamp":1605643743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15976-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159766","9783540396796"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-15976-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}