Triple
T799185
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Donald E. Knuth |
E17089
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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.
|
E94985
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a49378b9c48190adbf5f62e5b7aca1 |
elicitation | completed |
| NER | batch_69a4a7b4d9548190aad5fdf1211cf8cd |
ner | completed |
| NED1 | batch_69a67f01cca881908c1d230048be1225 |
ned_source_triple | completed |
| NED2 | batch_69a680bae34481909255d07f325d97d4 |
ned_description | completed |
| NEDg | batch_69a6800b410881909d95ab4c3612b501 |
nedg | completed |
Created at: March 1, 2026, 7:38 p.m.