Knuth-Bendix completion algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Etymology

[edit]

Named after Donald Knuth and Peter Bendix.

Proper noun

[edit]

Knuth-Bendix completion algorithm

  1. (computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.