Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,319 papers from all fields of science
Search
Sign In
Create Free Account
Knuth–Bendix completion algorithm
Known as:
Knuth–Bendix algorithm
, Knuth–Bendix completion
, Bendix
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Algorithm
Automated theorem proving
Buchberger's algorithm
Computational group theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Knuth-Bendix Completion Algorithm and Shuffle Algebras For Compiling NISQ Circuits
Raouf Dridi
,
H. Alghassi
,
S. Tayur
2019
Corpus ID: 141363567
Compiling quantum circuits lends itself to an elegant formulation in the language of rewriting systems on non commutative…
Expand
2003
2003
Congruence Closure with Integer Offsets
R. Nieuwenhuis
,
Albert Oliveras
Logic Programming and Automated Reasoning
2003
Corpus ID: 17138563
Congruence closure algorithms for deduction in ground equational theories are ubiquitous in many (semi-)decision procedures used…
Expand
1998
1998
Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Gröbner Bases Computation
C. Marché
1998
Corpus ID: 115687983
Buchberger’s algorithm and Knuth-Bendix completion are two fundamental algorithms used respectively in computer algebra and in…
Expand
1991
1991
Simulation Buchberger's Algorithm by Knuth-Bendix Completion
Reinhard Bündgen
International Conference on Rewriting Techniques…
1991
Corpus ID: 27435753
We present a canonical term rewriting system whose initial model is isomorphic to GF(q)[x1,...,x n ]. Using this set of rewrite…
Expand
Highly Cited
1991
Highly Cited
1991
Automating Inductionless Induction Using Test Sets
D. Kapur
,
P. Narendran
,
Hantao Zhang
Journal of symbolic computation
1991
Corpus ID: 15493703
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…
Expand
1988
1988
Positive/Negative Conditional Rewriting
S. Kaplan
Conditional and Typed Rewriting Systems
1988
Corpus ID: 28313639
This paper introduces positive/negative conditional term rewriting systems, with rules of the generic form: $$u = v \Lambda u…
Expand
1987
1987
How to Choose Weights in the Knuth Bendix Ordering
U. Martin
International Conference on Rewriting Techniques…
1987
Corpus ID: 35155149
Knuth and Bendix proposed a very versatile technique for ordering terms, based upon assigning weights to operators and then to…
Expand
1984
1984
Rewriting systems on FP expressions that reduce the number of sequences they yield
F. Bellegarde
LFP '84
1984
Corpus ID: 8949233
In this paper, we are interested in the application of program transformation for minimizing the number of intermediary sequences…
Expand
Highly Cited
1981
Highly Cited
1981
Laser Electro-Optic System For Rapid Three-Dimensional (3-D) Topographic Mapping Of Surfaces
M. Altschuler
,
B. Altschuler
,
J. Taboada
1981
Corpus ID: 13534986
A method is described for high-resolution remote three-dimensional mapping of an unknown and arbitrarily complex surface by…
Expand
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)
ACCEPT & CONTINUE