Jump to content

Encompassment ordering

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jochen Burghardt (talk | contribs) at 13:23, 4 June 2014 (→top: Huet's name). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In theoretical computer science, in particular in automated theorem proving and term rewriting, the containment,[1] or encompassment, preorder on the set of terms, is defined by

s≤t if a subterm of t is a substitution instance of s.

It is a preorder, i.e. reflexive and transitive, but not anti-symmetric,[note 1], nor total[note 2] [2] It is used e.g. in the Knuth-Bendix completion algorithm.

Notes

  1. ^ since both f(x) ≤ f(y) and f(y) ≤ f(x) for variable symbols x, y and a function symbol f
  2. ^ since neither a≤b nor b≤a for distinct constant symbols a, b

References

  1. ^ Gerard Huet (1981). "A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm". J. Comput. System Sci. 23 (1): 11–21.
  2. ^ N. Dershowitz, J.-P. Jouannaud (1990). Jan van Leeuwen (ed.). Rewrite Systems. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 243–320. Here:sect.2.1, p.250
Stub icon

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Encompassment_ordering&oldid=611525400"