Knuth-Bendix completion algorithm

English

Etymology

Named after Donald Knuth and Peter Bendix.

Proper noun

Knuth-Bendix completion algorithm

  1. (computing theory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewriting system.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.