Skip to search formSkip to main contentSkip to account menu

Knuth–Bendix completion algorithm

Known as: Knuth–Bendix algorithm, Knuth–Bendix completion, Bendix 
The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Compiling quantum circuits lends itself to an elegant formulation in the language of rewriting systems on non commutative… 
2003
2003
Congruence closure algorithms for deduction in ground equational theories are ubiquitous in many (semi-)decision procedures used… 
1998
1998
Buchberger’s algorithm and Knuth-Bendix completion are two fundamental algorithms used respectively in computer algebra and in… 
1991
1991
We present a canonical term rewriting system whose initial model is isomorphic to GF(q)[x1,...,x n ]. Using this set of rewrite… 
Review
1989
Review
1989
  • Alf Smith
  • 1989
  • Corpus ID: 60951711
Proving that something is a consequence of a set of axioms can be very difficult. The Knuth-Bendix completion algorithm attempts… 
1988
1988
This paper introduces positive/negative conditional term rewriting systems, with rules of the generic form: $$u = v \Lambda u… 
1987
1987
Knuth and Bendix proposed a very versatile technique for ordering terms, based upon assigning weights to operators and then to… 
1984
1984
In this paper, we are interested in the application of program transformation for minimizing the number of intermediary sequences… 
Highly Cited
1981
Highly Cited
1981
A method is described for high-resolution remote three-dimensional mapping of an unknown and arbitrarily complex surface by…