Knuth–Bendix order
E437487
recursive path ordering variant
reduction ordering
simplification ordering
term ordering
total ordering
well-founded ordering
The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Knuth–Bendix order canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4416467 — 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 order Context triple: [Knuth–Bendix completion algorithm, relatedTo, Knuth–Bendix order]
-
A.
Knuth–Bendix completion algorithm
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.
-
B.
Buchberger algorithm
The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
-
C.
Gröbner basis
A Gröbner basis is a particular generating set of an ideal in a polynomial ring that allows algorithmic solutions to many problems in computational algebra, such as ideal membership and solving systems of polynomial equations.
-
D.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
E.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
- 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 order Target entity description: The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.
-
A.
Knuth–Bendix completion algorithm
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.
-
B.
Buchberger algorithm
The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
-
C.
Gröbner basis
A Gröbner basis is a particular generating set of an ideal in a polynomial ring that allows algorithmic solutions to many problems in computational algebra, such as ideal membership and solving systems of polynomial equations.
-
D.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
E.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
recursive path ordering variant
ⓘ
reduction ordering ⓘ simplification ordering ⓘ term ordering ⓘ total ordering ⓘ well-founded ordering ⓘ |
| appliesTo |
first-order terms
ⓘ
terms over a signature ⓘ |
| assumes |
finite signature
ⓘ
non-negative weights for function symbols ⓘ |
| basedOn |
symbol precedence
ⓘ
weight function on function symbols ⓘ |
| comparedTo |
lexicographic path ordering
ⓘ
multiset path ordering ⓘ |
| definedBy |
Donald E. Knuth
ⓘ
Peter B. Bendix ⓘ |
| domain |
equational logic
ⓘ
universal algebra ⓘ |
| ensures | no infinite descending chains of terms ⓘ |
| field |
automated theorem proving
ⓘ
term rewriting systems ⓘ |
| formalizedIn | term rewriting theory ⓘ |
| guarantees | compatibility with rewriting rules when oriented by the order ⓘ |
| hasAlternativeName | KBO ⓘ |
| hasProperty |
monotonic
ⓘ
simplification ordering ⓘ stable under substitutions ⓘ total on ground terms ⓘ well-founded ⓘ |
| introducedIn | 1970s ⓘ |
| introducedInWork | "Simple word problems in universal algebras" ⓘ |
| relatedTo |
Church–Rosser property
ⓘ
completion procedure ⓘ convergent rewrite systems ⓘ |
| requires |
admissible weight function
ⓘ
total precedence on function symbols ⓘ |
| typeOf | simplification order on terms ⓘ |
| usedFor |
completion procedures
ⓘ
ensuring confluence of term rewriting systems ⓘ ensuring termination of term rewriting systems ⓘ equational theorem proving ⓘ |
| usedIn |
Knuth–Bendix completion algorithm
ⓘ
automated deduction systems ⓘ term rewriting termination proofs ⓘ |
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 order Description of subject: The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.