Completion of integral polynomials by AC-term completion

We present a canonical term rewriting system RX whose ground normal forms can directly be mapped to integral polynomials in distributive normal form. Completing RX and a set of ground equations simulates the Grobner base computation for the ideal presented by the ground equations. With our approach, we can clearly show the correspondences of the key features of algebraic completion procedures for integral polynomial ideals ([Lau76], [Buc84]) and their simulation in a term rewriting environment.

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

[2]  Paliath Narendran,et al.  An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras , 1985, RTA.

[3]  Pierre Lescanne,et al.  Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

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

[5]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

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

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

[8]  D. McIlroy.  Algebraic Simplification , 1966, CACM.

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

[10]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

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

[12]  Nachum Dershowitz,et al.  A Note on Simplification Orderings , 1979, Inf. Process. Lett..

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

[14]  Bruno Buchberger,et al.  A critical-pair/completion algorithm for finitely generated ideals in rings , 1983, Logic and Machines.

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

[16]  Nachum Dershowitz,et al.  Completion for Rewriting Modulo a Congruence , 1987, Theor. Comput. Sci..