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
2006
Review
2006
“Fair” Inequality? Attitudes toward Pay Differentials: The United States in Comparative Perspective
Are American attitudes toward economic inequality different from those in other countries? One tradition in sociology suggests… 
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… 
Highly Cited
2000
Highly Cited
2000
Termination of term rewriting using dependency pairs
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… 
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… 
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
1980
Highly Cited
1980
Proofs by induction in equational theories with constructors
  • G. HuetJ. Hullot
  • 21st Annual Symposium on Foundations of Computer…
  • 1980
  • Corpus ID: 9214469
Highly Cited
1980
Highly Cited
1980
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
  • G. Huet
  • Journal of the ACM
  • 1980
  • Corpus ID: 10264997
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems… 
Highly Cited
1979
Highly Cited
1979
Microchannel plate detectors
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… 
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)