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.
Graph-based ontology classification in OWL 2 QL / Lembo, Domenico; Santarelli, Valerio; Savo, Domenico Fabio. - STAMPA. - 7882:(2013), pp. 320-334. (Intervento presentato al convegno 10th International Conference on The Semantic Web: Semantics and Big Data, ESWC 2013 tenutosi a Montpellier nel 26-30 May 2013) [10.1007/978-3-642-38288-8-22].
Graph-based ontology classification in OWL 2 QL
LEMBO, Domenico;SANTARELLI, VALERIO;SAVO, Domenico Fabio
2013
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.File | Dimensione | Formato | |
---|---|---|---|
VE_2013_11573-537263.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
273.33 kB
Formato
Adobe PDF
|
273.33 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.