C94-2127 top-down methods which require subsumption checking and restriction to avoid prediction
C96-1085 an extremely resource-intensive subsumption checking method unnecessary in the PARSETALK
P00-1045 defer copying until we completed subsumption checking . Packed Nodes With a straightforward
C02-2024 The size of the unifiability and subsumption checking tables is negligible in comparison
P96-1033 evaluation with abstraction and subsumption checking . For a large class of grammars
C02-1113 common are consistency checking , subsumption checking , and instance and relation check
W15-0125 semantic framework should allow subsumption checking from the representation alone
J88-1004 operations that we need for IDR are subsumption checking and the computation of greatest
P83-1021 positions . A simplification of full subsumption checking that would appear adequate to
W03-0809 , such as class consistency or subsumption checking . The OIL language employs frame
C02-2024 unifiability checking table and the two subsumption checking tables was 13 MByte . The size
P96-1033 discussed in the previous sec - tion , subsumption checking can not always be elim - inated
J91-4002 symbols , or , if we need to support subsumption checking , conjunctions of a single negated
P00-1045 copying , we also use a table for subsumption checking . Tomabechi 's algorithm requires
J91-4002 behavior of the key operations of subsumption checking and unification as they apply
W03-0903 , such as class consistency or subsumption checking . Graphical ontology engineering
C02-2024 or more-general , by preparing subsumption checking tables in the same way it prepared
P96-1033 semi-naive evaluation without subsumption checking ( Ramakrishnan et al. , 1992
C94-2127 need for the costly operation of subsumption checking ) Search Strategy : In the case
P96-1033 function . As a result of the 3.1 Subsumption Checking explicit representation of filtering
hide detail