Knuth–Bendix completion algorithm
id:
knuth-bendix-completion-algorithm-242-17417456
title:
Knuth–Bendix completion algorithm
text:
The Knuth–Bendix completion algorithm is a semi-decision algorithm for transforming a set of equations into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra. Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth–Bendix algorithm in the theory of polynomial rings.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Knuth%E2%80%93Bendix_completion_algorithm
date created:
date modified:
2023-03-27T14:46:08Z
main entity:
{"identifier":"Q2835803","url":"https://www.wikidata.org/entity/Q2835803"}
image:
fields total:
13
integrity:
13