Knuth–Bendix completion algorithm

The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is a semi-decision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra.

Source: Wikipedia — Knuth–Bendix completion algorithm (CC BY-SA 4.0)