Abstract. The complexity of the subsumption problem in description logics can vary widely with the choice of the syntactic fragment and the semantic ...
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics · M. MendlerStephan Scheele. Computer Science ...
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. M Mendler, S Scheele. Description Logics 477, 2009.
Oct 4, 2024 · Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. Description Logics 2009; 2008. [j13].
Mendler, M. (2009) Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics, 22nd International Workshop on ...
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. M Mendler, S Scheele. Description Logics 477, 2009.
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. A Non-Well-Founded Approach to Terminological Cycles.
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics · M. Mendler · Description Logics ; Generalized ...
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. M Mendler, S Scheele. Description Logics 477, 2009.
Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. view. electronic edition @ ceur-ws.org (open access) ...