Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

19 relations
AlgorithmAutomated theorem provingBuchberger's algorithmComputational group theory
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
Termination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
OTTER 3.0 Reference Manual and Guide
OTTER (Organized Techniques for Theorem-proving and Effective Research) is a resolution-style theorem-proving program for first… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm
Abstract We show that in a free F-algebra endowed with a strict order we can associate with a complete rewriting system in the… Expand
Is this relevant?
1982
1982
A Theorem-Proving Approach to the Knuth-Bendix Completion Algorithm
The process of algebraic abstract data type completion has some similarities with resolution theorem-proving. In particular, some… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm
  • G. Huet
  • J. Comput. Syst. Sci.
  • 1981
    • Corpus ID: 16602345
Abstract We give in this paper a complete description of the Knuth-Bendix completion algorithm. We prove its correctness in full… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Complete Sets of Reductions for Some Equational Theories
An extenston of the Knuth-Bendix algorithm for finding complete sets of reductions is described. The extension is intended to… Expand
  • figure 1
  • table I
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Canonical Forms and Unification
Fay has described in [2,3] a complete T-unification for equational theories T which possess a complete set of reductions as… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Microchannel plate detectors
A microchannel plate (MCP) is an array of 104-107 miniature electron multipliers oriented parallel to one another (fig. 1… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Conflunt reductions: Abstract properties and applications to term rewriting systems
  • G. Huet
  • 18th Annual Symposium on Foundations of Computer…
  • 1977
    • Corpus ID: 206558490
This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE