论文信息 - Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract)

Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract)

We show how Buchberger's algorithm for Q[x1,..., xr] can be simulated using term completion modulo AC. To specify the rational numbers an infinite term rewriting system is needed. However, for the simulation of each particular ideal completion a finite approximation of the infinite rule set is sufficient. This approximation can be constructed during the completion. Then the division operation in Q reduces to a narrowing procedure which becomes part of the critical pair computation process.

Reinhard Bündgen

[1] Nachum Dershowitz,et al. Completion and Its Applications , 1989 .

[2] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3] Reinhard Bündgen. Simulation Buchberger's Algorithm by Knuth-Bendix Completion , 1991, RTA.

[4] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[5] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[6] Franz Winkler,et al. Knuth-Bendix procedure and Buchberger algorithm: a synthesis , 1989, ISSAC '89.

[7] Rüdiger Loos,et al. Term Reduction Systems and Algebraic Algorithms , 1981, GWAI.

[8] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[9] Reinhard Bündgen. Completion of integral polynomials by AC-term completion , 1991, ISSAC '91.

[10] Philippe le Chenadec. Canonical forms in finitely presented algebras , 1984, Research notes in theoretical computer science.