Knuth–Bendix completion algorithm
E94985
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Knuth–Bendix completion algorithm canonical | 4 |
| term rewriting systems | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T799185 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Knuth–Bendix completion algorithm Context triple: [Donald E. Knuth, knownFor, Knuth–Bendix completion algorithm]
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Bruno Buchberger
Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
-
D.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
E.
Hilbert’s syzygy theorem
Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Knuth–Bendix completion algorithm Target entity description: The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Bruno Buchberger
Bruno Buchberger is an Austrian mathematician best known for introducing Gröbner bases, a fundamental tool in computer algebra and symbolic computation.
-
D.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
E.
Hilbert’s syzygy theorem
Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
algorithm
ⓘ
automated theorem proving technique ⓘ term rewriting procedure ⓘ |
| appliesTo |
algebraic structures
ⓘ
equational theories ⓘ word problems in groups ⓘ word problems in monoids ⓘ word problems in semigroups ⓘ |
| assumes |
finite signature of function symbols
ⓘ
well-founded reduction ordering on terms ⓘ |
| basedOn |
equational reasoning
ⓘ
term rewriting systems ⓘ |
| enables | decision of the word problem for the completed theory ⓘ |
| field |
automated theorem proving
ⓘ
equational logic ⓘ term rewriting ⓘ universal algebra ⓘ |
| goal |
confluence
ⓘ
termination of the rewrite system ⓘ |
| hasProperty |
can produce a confluent and terminating rewrite system when it succeeds
ⓘ
may not terminate in general ⓘ semi-decision procedure ⓘ |
| input | finite set of equations ⓘ |
| inventedBy |
Donald E. Knuth
ⓘ
Peter B. Bendix ⓘ |
| output |
confluent term rewriting system when completion succeeds
ⓘ
set of oriented rewrite rules ⓘ |
| publishedIn | Journal of the ACM ⓘ |
| purpose |
decide word problems in algebraic structures
ⓘ
transform a set of equations into a confluent rewriting system ⓘ |
| relatedTo |
Buchberger algorithm
ⓘ
Church–Rosser property ⓘ Gröbner basis ⓘ Knuth–Bendix order ⓘ confluent rewriting system ⓘ critical pair lemma ⓘ termination orderings ⓘ |
| step |
add new equations from unresolved critical pairs
ⓘ
compute critical pairs of rewrite rules ⓘ orient equations into rewrite rules using a reduction ordering ⓘ simplify equations and rules using existing rules ⓘ |
| usedIn |
automated theorem provers
ⓘ
completion-based theorem proving systems ⓘ equational theorem proving ⓘ |
| uses |
completion of rewrite rules
ⓘ
critical pair computation ⓘ reduction orderings ⓘ |
| yearProposed | 1970 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Knuth–Bendix completion algorithm Description of subject: The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Knuth–Bendix completion algorithm