{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:45Z","timestamp":1725664605429},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629504"},{"type":"electronic","value":"9783540690511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62950-5_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:58:16Z","timestamp":1330297096000},"page":"113-127","source":"Crossref","is-referenced-by-count":5,"title":["D-bases for polynomial ideals over commutative noetherian rings"],"prefix":"10.1007","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-7118-2","volume-title":"Canonical equational proofs","author":"L. Bachmair","year":"1991","unstructured":"L. Bachmair. Canonical equational proofs. Birkh\u00e4user, Boston, 1991."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(89)90003-0","volume":"67","author":"L. Bachmair","year":"1989","unstructured":"L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67:173\u2013201, 1989.","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"L. Bachmair and H. Ganzinger. Buchberger's algorithm: a constraint-based completion procedure. In 1st Int. Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 285\u2013301. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0016860"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(85)80019-5","volume":"1","author":"L. Bachmair","year":"1985","unstructured":"L. Bachmair and D. Plaisted. Termination orderings for associative-commutative rewriting systems. J. Symbolic Computation, 1:329\u2013349, 1985.","journal-title":"J. Symbolic Computation"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/174652.174655","volume":"41","author":"L. Bachmair","year":"1994","unstructured":"Leo Bachmair and Nachum Dershowitz. Equational inference, canonical proofs, and proof orderings. J. of the Association for Computing Machinery, 41:236\u2013276, 1994.","journal-title":"J. of the Association for Computing Machinery"},{"key":"9_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner bases: a computational approach to commutative algebra","author":"T. Becker","year":"1993","unstructured":"T. Becker and V. Weispfenning. Gr\u00f6bner bases: a computational approach to commutative algebra. Springer-Verlag, Berlin, 1993."},{"key":"9_CR7","volume-title":"PhD thesis","author":"B. Buchberger","year":"1965","unstructured":"B. Buchberger. An algorithm for finding a basis for the residue class ring of a zero-dimensional ideal. PhD thesis, University of Innsbruck, Austria, 1965."},{"key":"9_CR8","first-page":"137","volume-title":"volume 171 of Lect. Notes in Comput. Sci.","author":"B. Buchberger","year":"1983","unstructured":"B. Buchberger. A critical-pair completion algorithm for finitely generated ideals in rings. In Proc. Logic and Machines: Decision Problems and Complexity, volume 171 of Lect. Notes in Comput. Sci., pages 137\u2013161. Springer-Verlag, Berlin, 1983."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"B. Buchberger. Gr\u00f6bner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, pages 184\u2013232. Reidel, 1985.","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"R. B\u00fcndgen. Buchberger's algorithm: The term rewriter's point of view. Theoretical Computer Science, 1996. To appear.","DOI":"10.1016\/0304-3975(95)00061-5"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0747-7171(88)80020-8","volume":"6","author":"A. Kandri-Rody","year":"1988","unstructured":"A. Kandri-Rody and D. Kapur. Computing a Gr\u00f6bner basis of a polynomial ideal over a Euclidean domain. J. Symbolic Computation, 6:37\u201357, 1988.","journal-title":"J. Symbolic Computation"},{"key":"9_CR12","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Fran\u00e7aise d'Intelligence Artificielle, 4:9\u201352, 1990.","journal-title":"Revue Fran\u00e7aise d'Intelligence Artificielle"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"K. Madlener and B. Reinert. Computing Gr\u00f6bner bases in monoid and group rings. In Proc. ISSAC 93, pages 254\u2013263. 1993.","DOI":"10.1145\/164081.164139"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0747-7171(89)80006-9","volume":"7","author":"L. Pan","year":"1988","unstructured":"L. Pan. On the D-bases of polynomial ideals over principal ideal domains. J. Symbolic Computation, 7:55\u201369, 1988.","journal-title":"J. Symbolic Computation"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. E. Peterson","year":"1981","unstructured":"G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. of the Association for Computing Machinery, 28:233\u2013264, 1981.","journal-title":"J. of the Association for Computing Machinery"},{"issue":"2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1090\/S0002-9939-1974-0416874-9","volume":"44","author":"F. Richman","year":"1974","unstructured":"F. Richman. Constructive aspects of Noetherian rings. Proc. of the American Mathematical Society, 44(2):436\u2013441, 1974.","journal-title":"Proc. of the American Mathematical Society"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0747-7171(87)80012-3","volume":"4","author":"S. Stifter","year":"1987","unstructured":"S. Stifter. A generalization of reduction rings. J. Symbolic Computation, 4:351\u2013364, 1987.","journal-title":"J. Symbolic Computation"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0022-314X(78)90019-7","volume":"10","author":"W. Trinks","year":"1978","unstructured":"W. Trinks. On B. Buchberger's method for solving algebraic equations. J. Number Theory, 10(4):475\u2013488, 1978. (German).","journal-title":"J. Number Theory"}],"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-62950-5_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:04Z","timestamp":1605647704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62950-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629504","9783540690511"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-62950-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}