English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Buchberger's algorithm: a constraint-based completion procedure

MPS-Authors
/persons/resource/persons44055

Bachmair,  Leo
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bachmair, L., & Ganzinger, H. (1994). Buchberger's algorithm: a constraint-based completion procedure. In J.-P. Jouannaud (Ed.), Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94) (pp. 285-301). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AD63-C
Abstract
We present an extended completion procedure with built-in theories defined by a collection of associativity and commutativity axioms and additional ground equations, and reformulate Buchberger's algorithm for constructing Gr\"obner 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.