D-bases for polynomial ideals over commutative noetherian rings

  • Leo Bachmair
  • Ashish Tiwari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1232)


We present a completion-like procedure for constructing D-bases for polynomial ideals over commutative Noetherian rings with. unit. The procedure is described at an abstract level, by transition rules. Its termination is proved under certain assumptions about the strategy that controls the application of the transition rules. Correctness is established by proof simplification techniques.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Bachmair. Canonical equational proofs. Birkhäuser, Boston, 1991.Google Scholar
  2. 2.
    L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67:173–201, 1989.CrossRefGoogle Scholar
  3. 3.
    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–301. Springer-Verlag, 1994.Google Scholar
  4. 4.
    L. Bachmair and D. Plaisted. Termination orderings for associative-commutative rewriting systems. J. Symbolic Computation, 1:329–349, 1985.Google Scholar
  5. 5.
    Leo Bachmair and Nachum Dershowitz. Equational inference, canonical proofs, and proof orderings. J. of the Association for Computing Machinery, 41:236–276, 1994.Google Scholar
  6. 6.
    T. Becker and V. Weispfenning. Gröbner bases: a computational approach to commutative algebra. Springer-Verlag, Berlin, 1993.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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–161. Springer-Verlag, Berlin, 1983.Google Scholar
  9. 9.
    B. Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, pages 184–232. Reidel, 1985.Google Scholar
  10. 10.
    R. Bündgen. Buchberger's algorithm: The term rewriter's point of view. Theoretical Computer Science, 1996. To appear.Google Scholar
  11. 11.
    A. Kandri-Rody and D. Kapur. Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. J. Symbolic Computation, 6:37–57, 1988.Google Scholar
  12. 12.
    C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4:9–52, 1990.Google Scholar
  13. 13.
    K. Madlener and B. Reinert. Computing Gröbner bases in monoid and group rings. In Proc. ISSAC 93, pages 254–263. 1993.Google Scholar
  14. 14.
    L. Pan. On the D-bases of polynomial ideals over principal ideal domains. J. Symbolic Computation, 7:55–69, 1988.Google Scholar
  15. 15.
    G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. of the Association for Computing Machinery, 28:233–264, 1981.Google Scholar
  16. 16.
    F. Richman. Constructive aspects of Noetherian rings. Proc. of the American Mathematical Society, 44(2):436–441, 1974.Google Scholar
  17. 17.
    S. Stifter. A generalization of reduction rings. J. Symbolic Computation, 4:351–364, 1987.Google Scholar
  18. 18.
    W. Trinks. On B. Buchberger's method for solving algebraic equations. J. Number Theory, 10(4):475–488, 1978. (German).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Leo Bachmair
    • 1
  • Ashish Tiwari
    • 1
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookUSA

Personalised recommendations