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)

Related topics

Related topics

19 relations
AlgorithmAutomated theorem provingBuchberger's algorithmComputational group theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
5 Challenges and Unsolved Problems
data [76]. Parallel sets can be considered an extension of parallel coordinates. This visualization shows the relationships… 
2003
2003
Jamming the Reception: Ken Burns, Jazz, and the Problem of "America's Music"
INTRODUCTION In 2001 the nation paid more attention to jazz than it had for a long time. With its first aired episode on 8… 
Review
1989
Review
1989
The Knuth-Bendix Completion Algorithm and Its Specification in Z
  • Alf Smith
  • Z User Workshop
  • 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
Positive/Negative Conditional Rewriting
This paper introduces positive/negative conditional term rewriting systems, with rules of the generic form: $$u = v \Lambda u… 
1987
1987
Application of Term Rewriting Techniques to Hardware Design Verification
Term rewriting systems have been used in automatic theorem proving. A canonical term rewriting system for boolean algebra… 
1987
1987
How to Choose Weights in the Knuth Bendix Ordering
Knuth and Bendix proposed a very versatile technique for ordering terms, based upon assigning weights to operators and then to… 
1986
1986
On Nontermination of Knuth-Bendix Algorithm
The well-known Knuth-Bendix completion algorithm which computes a confluent and finitely terminating term rewriting system from a… 
1986
1986
Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings
1984
1984
Rewriting systems on FP expressions that reduce the number of sequences they yield
In this paper, we are interested in the application of program transformation for minimizing the number of intermediary sequences… 
1984
1984
From ACE to the G-15
The 1946 Turing proposal for a stored-program computer at Britain's National Physical Laboratory is briefly described. The author… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)