ReAD: AD-Based Modular Ontology Classification

Abstract For OWL ontologies, classification is the central reasoning task, and several highly-optimised reasoners have been designed for different fragments of OWL. Some of these exploit different notions of modularity, including the atomic decomposition (AD), to further optimise their performance, but this is a complex task due to ontology modules overlapping, thereby possibly causing duplication of subsumption tests. In this paper, we use the AD to avoid both this duplication as well as other subsumption tests that can be avoided by inspecting the AD. We have designed and implemented a new AD-informed and \(\mathsf {MORe}\) -inspired algorithm that uses \(\mathsf {Hermit}\) and \(\mathsf {ELK}\) as delegate reasoners, but avoids any duplicate subsumption tests between these two reasoners and further minimises these tests. We have thoroughly evaluated the effects of these two kinds of avoidance on the overall classification time on a corpus of complex ontologies.

Authors

• Haoruo Zhao
• Bijan Parsia
• Ulrike Sattler

Keywords

No keywords are indexed for this paper.