Details:
Title | Buchberger's Algorithm: A Constraint-Based Completion Procedure | Author(s) | Leo Bachmair, Harald Ganzinger | Type | Article in Conference Proceedings | Abstract | We present an extended completion procedure with builtin theories defined by a collection of associativity and commutativity axioms and additional ground equations, and reformulate Buchberger's algorithm for constructing Grobner bases for polynomial ideals in this formalism. The presentation of completion is at an abstract level, by transition rules, with a suitable notion of fairness used to characterize a wide class of correct completion procedures, among them Buchberger's original algorithm for polynomial rings over a field. |
File |
| Language | English | Pages | 285-301 | Year | 1994 | Translation |
No | Refereed |
No |
|