首页 正文

OWL Reasoning: Subsumption Test Hardness and Modularity

{{output}}
Reasoning with SROIQ(D) , the logic that underpins the popular Web Ontology Language (OWL), has a high worst case complexity (N2Exptime). Decomposing the ontology into modules prior to classification, and then classifying the composites one-by-one, has been su... ...