Simulating Buchberger's algorithm by Knuth-Bendix completion

  • Reinhard Bündgen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 488)


We present a canonical term rewriting system whose initial model is isomorphic to GF(q)[x1,...,x n ]. Using this set of rewrite rules and additional ground equations specifying an ideal we can simulate Buchberger's algorithm for polynomials over finite fields using Knuth-Bendix term completion modulo AC. In order to simplify our proofs we exhibit a critical pair criterion which transforms critical pairs into simpler ones.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD88]
    Leo Bachmair and Nachum Dershowitz. Critical pair criteria for completion. Journal of Symbolic Computation, 6:1–18, 1988.Google Scholar
  2. [BL82]
    Bruno Buchberger and Rüdiger Loos. Algebraic simplification. In Computer Algebra, pages 14–43, Springer-Verlag, 1982.Google Scholar
  3. [Buc65]
    Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Universität Innsbruck, 1965.Google Scholar
  4. [Buc85]
    Bruno Buchberger. Gröbner bases: an algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, Reidel, 1985.Google Scholar
  5. [Bün90]
    Reinhard Bündgen. Completion of Bases for Multivariate Polynomials over Commutative Rings with the Term Completion Procedure According to Peterson and Stickel. Technical Report 90–8, Wilhelm-Schickard-Institut, D-7400 Tübingen, 1990.Google Scholar
  6. [Der79]
    Nachum Dershowitz. A note on simplification orderings. Inf. Proc. Letters, 9:212–215, 1979.Google Scholar
  7. [Der87]
    Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–115, 1987.Google Scholar
  8. [Der89]
    Nachum Dershowitz. Completion and its applications. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Academic Press, 1989.Google Scholar
  9. [Hsi82]
    Jieh Hsiang. Topics in Automated Theorem Proving and Program Generation. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, Il, USA, December 1982.Google Scholar
  10. [JK86]
    Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. on Computing, 14(4):1155–1194, 1986.Google Scholar
  11. [KB70]
    Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, Pergamon Press, 1970.Google Scholar
  12. [KKN85]
    A. Kandri-Rody, D. Kapur, and P. Narendran. An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras. In Rewriting Techniques and Applications (LNCS 202), pages 345–364, 1985.Google Scholar
  13. [KKW89]
    A. Kandri-Rody, D. Kapur, and F. Winkler. Knuth-Bendix procedure and Buchberger algorithm — a synthesis. In International Symposium on Symbolic and Algebraic Computation, pages 55–67, 1989.Google Scholar
  14. [KN85]
    Deepak Kapur and Paliath Narendran. An equational aproach to theorem proving in first order predicate calculus. In Arvind Joshi, editor, Proceedings of the Ninth International Conference on Artificial Intelligence, 1985.Google Scholar
  15. [Küc82]
    Wolfgang Küchlin. An Implementation and Investigation of the Knuth-Bendix Completion Algorithm. Master's thesis, Informatik I, Universität Karlsruhe, D-7500 Karlsruhe, W-Germany, 1982. (Reprinted as Report 17/82.).Google Scholar
  16. [Küc86]
    Wolfgang Küchlin. A Generalized Knuth-Bendix Algorithm. Technical Report 86-01, Mathematics, Swiss Federal Institute of Technology (ETH), CH-8092 Zürich, Switzerland, January 1986.Google Scholar
  17. [LC86]
    Philippe Le Chenadec. Canonical Forms in Finitely Presented Algebras. Pitman, London, 1986.Google Scholar
  18. [Loo81]
    Rüdiger Loos. Term reduction systems and algebraic algorithms. In Jörg H. Siekmann, editor, GWAI-81 (IFB 47), pages 214–234, Springer-Verlag, 1981.Google Scholar
  19. [PS81]
    G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:223–264, 1981.Google Scholar
  20. [Sti81]
    Mark E. Stickel. A unification algorithm for associative-commutative functions. JACM, 28(3):423–434, July 1981.Google Scholar
  21. [WB85]
    Franz Winkler and Bruno Buchberger. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. In Proc. Colloquium on Algebra, Combinatorics and Logic in Computer Science, J. Bolyai Math. Soc., 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Reinhard Bündgen
    • 1
  1. 1.Wilhelm-Schickard-InstitutUniversität TübingenTübingenFed. Rep. of Germany

Personalised recommendations