Knuth-Bendix completion
Description: Knuth–Bendix completion is a procedure in computational algebra and automated reasoning that transforms equations into rewrite rules intended to yield a confluent system.
Primary topic: Logic, programming, and type systems (73%)
Wikidata ID: wiki/Q2835803
OpenAlex ID: keywords/knuth-bendix-completion
