Jump to content

Knuth–Bendix completion algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David.Monniaux (talk | contribs) at 15:28, 23 April 2004 (short stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Knuth-Bendix completion algorithm is an algorithm for making a term rewriting system out of an equational system.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Knuth–Bendix_completion_algorithm&oldid=3830727"