Knuth–Bendix order

E437487 UNEXPLORED

The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.

Jump to: Referenced by

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Knuth–Bendix completion algorithm relatedTo Knuth–Bendix order