A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We analyse the relations between completion procedures for polynomials and terms and thereby show how Buchberger's algorithm for multivariate polynomials over finite fields and over the rationals 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 thedoi:10.1016/0304-3975(95)00061-5 fatcat:7htfv4v4ebhd3j2fetbhhqjf4u