Simulating Buchberger's algorithm by Knuth-Bendix completion

DOI10.1007/3-540-53904-2_112zbMath1503.68092OpenAlexW1495940585MaRDI QIDQ5055776

Reinhard Bündgen

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_112

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Finite fields (field-theoretic aspects) (12E20) Grammars and rewriting systems (68Q42)

Related Items (2)

Buchberger's algorithm: The term rewriter's point of view ⋮ A categorical critical-pair completion algorithm

Cites Work

• Termination of rewriting
• Critical pair criteria for completion
• A note on simplification orderings
• Completion for rewriting modulo a congruence
• Completion of a Set of Rules Modulo a Set of Equations
• A Unification Algorithm for Associative-Commutative Functions
• Complete Sets of Reductions for Some Equational Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simulating Buchberger's algorithm by Knuth-Bendix completion