Searching for "A Complete Subsumption Algorithm." – sorted by Relevance.
-
Computational Complexity of Terminological Reasoning in BACK
- for a complete and tractable subsumption algorithm. And this was indeed a program which was proposed
- Cited by 59 (11 self) – Add To MetaCart
-
Theory-driven Logical Scaling
- Logic as `expert' ([1]). This can be done with each logic that has a complete subsumption algorithm
- Cited by 4 (1 self) – Add To MetaCart
-
Modeling and Verifying Complex Objects: A Declarative Approach Based on Description Logics
- providing a complete subsumption algorithm (e.g CLASSIC), our rules are just useful for trace purposes. When
- Cited by 3 (1 self) – Add To MetaCart
-
Adding more "DL" to "IDL": towards more knowledgeable component inter-operability
- (versions of the first 11 in the first table on page 3) standard classic [6] has a complete subsumption
- Cited by 14 (0 self) – Add To MetaCart
-
Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis
- . For logics having a complete subsumption algorithm, this algorithm can be considered as `expert
- Cited by 4 (2 self) – Add To MetaCart
-
A Normal Form For Typed Feature Structures
- form structures under its intended meaning, yet that it is possible to define a complete subsumption
- Cited by 7 (1 self) – Add To MetaCart
-
"What's not in a name?" - Initial Explorations of a Structural Approach to Integrating Large
- ). For example, classic [ABM + 89] has a complete subsumption algorithm that is O(n 3 ). Also, recent
- Cited by 7 (4 self) – Add To MetaCart
-
Structural Subsumption Considered from an Automata-Theoretic Point of View
- , this straightforward extension is not sufficient to obtain a complete subsumption algorithm. Example 5. If we treat
- Add To MetaCart

