Encompassment ordering
id:
encompassment-ordering-257-16281172
title:
Encompassment ordering
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Term ordering in abstract rewriting
original url:
https://en.wikipedia.org/wiki/Encompassment_ordering
date created:
date modified:
2023-10-21T06:39:07Z
main entity:
{"identifier":"Q18353532","url":"https://www.wikidata.org/entity/Q18353532"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/44/Encompassment_ordering_on_terms_s%2Ct_svg.svg","width":287,"height":294}
fields total:
13
integrity:
15