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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland… (More)
Is this relevant?
2013
2013
We present extensions of our Isabelle Formalization of Rewriting that cover two historically related concepts: the Knuth-Bendix… (More)
  • figure 1
Is this relevant?
2007
2007
Knuth-Bendix completion takes as input a set of universal equations and attempts to generate a convergent rewriting system with… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2006
2006
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
Knuth-Bendix completions of the equational theories of k ≥ 2 commuting group endomorphisms are obtained, using automated theorem… (More)
Is this relevant?
1994
1994
We will answer a question posed in DJK91], and will show that Huet's completion algorithm Hu81] becomes incomplete, i.e. it may… (More)
Is this relevant?
1991
1991
Thomas, M. and P. Watson, Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science 112… (More)
Is this relevant?
1990
1990
Knuth and Bendix proposed a very versatile technique for ordering terms, based upon assigning weights to operators and then to… (More)
Is this relevant?
1989
1989
The Knuth-Bendix procedure for the completion of a rewrite rule system and the Buchberger algorithm for computing a Gröbner basis… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We give in this paper a complete description of the Knuth-Bendix completion algorithm. We prove its correctness in full… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?