# Knuth–Bendix completion algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Formalized Mathematics
- 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

- RTA
- 2013

We present extensions of our Isabelle Formalization of Rewriting that cover two historically related concepts: the Knuth-Bendix… (More)

Is this relevant?

2007

2007

- 2007

Knuth-Bendix completion takes as input a set of universal equations and attempts to generate a convergent rewriting system with… (More)

Is this relevant?

2006

2006

- RTA
- 2006

A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and… (More)

Is this relevant?

2006

2006

- Inf. Process. Lett.
- 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

- STACS
- 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

- AMAST
- 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

- Acta Informatica
- 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

- ISSAC
- 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

- J. Comput. Syst. Sci.
- 1981

We give in this paper a complete description of the Knuth-Bendix completion algorithm. We prove its correctness in full… (More)

Is this relevant?