A Graph-Based Approach for Classifying OWL 2 QL Ontologies

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.

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Lembo2013AGA, title={A Graph-Based Approach for Classifying OWL 2 QL Ontologies}, author={Domenico Lembo and Valerio Santarelli and Domenico Fabio Savo}, booktitle={Description Logics}, year={2013} }