Buchberger's algorithm: The term rewriter's point of view
- 1 June 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 159 (2) , 143-190
- https://doi.org/10.1016/0304-3975(95)00061-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Critical pair criteria for completionJournal of Symbolic Computation, 1988
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domainJournal of Symbolic Computation, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- New decision algorithms for finitely presented commutative semigroupsComputers & Mathematics with Applications, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A note on simplification orderingsInformation Processing Letters, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979