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.
Highly Cited
2004
Highly Cited
2004
Stakeholder Rights and Corporate Governance: A Cross-National Study of Hostile Takeovers
We examine the role of three types of stakeholders in the uneven adoption of an organizational practice in different countries… 
Review
2004
Review
2004
Searching for Transitologists: Contemporary Theories of Post-Communist Transitions and the Myth of a Dominant Paradigm
A political scientist investigates the claim that the field of post-communist studies is and has been dominated by a transitology… 
Highly Cited
2003
Highly Cited
2003
OTTER 3.3 Reference Manual
OTTER is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules… 
Highly Cited
1990
Highly Cited
1990
Pseudo-random generators under uniform assumptions
1. I n t r o d u c t i o n Randomness have been playing an ever increasing role in computer science. The demand for cheap random… 
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… 
Highly Cited
1985
Highly Cited
1985
Operational Semantics for Order-Sorted Algebra
1985
1985
Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A "Unification" of Different Approaches
The Knuth-Bendix completion procedure for rewrite rule systems is of wide applicability in symbolic and algebraic computation… 
Highly Cited
1985
Highly Cited
1985
Semantic Confluence Tests and Completion Methods
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… 
Highly Cited
1979
Highly Cited
1979
Microchannel plate detectors
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)