About: Encompassment ordering

An Entity of Type: martial artist, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 s ≤ t if a subterm of t is a substitution instance of s. It is used e.g. in the Knuth–Bendix completion algorithm.

thumbnail
Property Value
dbo:abstract
  • 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 s ≤ t if a subterm of t is a substitution instance of s. It is used e.g. in the Knuth–Bendix completion algorithm. (en)
dbo:thumbnail
dbo:wikiPageID
  • 42964077 (xsd:integer)
dbo:wikiPageLength
  • 2974 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1089040954 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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 s ≤ t if a subterm of t is a substitution instance of s. It is used e.g. in the Knuth–Bendix completion algorithm. (en)
rdfs:label
  • Encompassment ordering (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License