Skip to search formSkip to main contentSkip to account menu

Encompassment ordering

Known as: Encompassment preorder 
In theoretical computer science, in particular in automated theorem proving and term rewriting,the containment, or encompassment, preorder (≤) on the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Automated theorem provingKnuth–Bendix completion algorithmRewrite orderTerm (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
From Life to Artistic Sensation
The process from life to art is the process of sensational advance,evolution,encompassment and materialization,which have to do… 
1990
1990
Well rewrite orderings
  • P. Lescanne
  • [] Proceedings. Fifth Annual IEEE Symposium on…
  • 1990
  • Corpus ID: 12216754
A study is made of well (quasi) orderings which are described as rewrite orderings, and a family of well (quasi) orderings that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)