Abstract
Ontology classification is the reasoning service that computes all subsumption relationships inferred in an ontology between concept, role, and attribute names in the ontology signature. OWL 2 QL is a tractable profile of OWL 2 for which ontology classification is polynomial in the size of the ontology TBox. However, to date, no efficient methods and implementations specifically tailored to OWL 2 QL ontologies have been developed. In this paper, we provide a new algorithm for ontology classification in OWL 2 QL, which is based on the idea of encoding the ontology TBox into a directed graph and reducing core reasoning to computation of the transitive closure of the graph. We have implemented the algorithm in the QuOnto reasoner and extensively evaluated it over very large ontologies. Our experiments show that QuOnto outperforms various popular reasoners in classification of OWL 2 QL ontologies. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lembo, D., Santarelli, V., & Savo, D. F. (2013). Graph-based ontology classification in OWL 2 QL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7882 LNCS, pp. 320–334). Springer Verlag. https://doi.org/10.1007/978-3-642-38288-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
