![]() | ||
In theoretical computer science, in particular in automated theorem proving and term rewriting, the containment, or encompassment, preorder (≤) on the set of terms, is defined by
It is used e.g. in the Knuth–Bendix completion algorithm.
Properties
References
Encompassment ordering Wikipedia(Text) CC BY-SA