Graph-Based Ontology Classification in OWL 2 QL. Lembo, D., Santarelli, V., Savo, & Fabio, D. In Cimiano, P., Corcho, Ó., Presutti, V., Hollink, L., & Rudolph, S., editors, ESWC, volume 7882, of Lecture Notes in Computer Science, pages 320-334, 2013. Springer.
Graph-Based Ontology Classification in OWL 2 QL. [link]Paper  Graph-Based Ontology Classification in OWL 2 QL. [link]Link  abstract   bibtex   
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
@inproceedings{ conf/esws/LemboSS13,
  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},
  added-at = {2014-06-02T12:39:08.000+0200},
  audience = {academic},
  author = {Lembo, Domenico and Santarelli, Valerio and Savo, Domenico Fabio},
  biburl = {http://www.bibsonomy.org/bibtex/233668e58bcbae51a3cd60c91ca891971/savo.fabio},
  booktitle = {ESWC},
  editor = {Cimiano, Philipp and Corcho, Óscar and Presutti, Valentina and Hollink, Laura and Rudolph, Sebastian},
  ee = {http://dx.doi.org/10.1007/978-3-642-38288-8_22},
  interhash = {a8d60f61e429cb131f3999b8b43a4d55},
  intrahash = {33668e58bcbae51a3cd60c91ca891971},
  isbn = {978-3-642-38288-8},
  keywords = {myown optique-project},
  pages = {320-334},
  partneroptique = {UNIROMA1},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Graph-Based Ontology Classification in OWL 2 QL.},
  url = {http://dblp.uni-trier.de/db/conf/esws/eswc2013.html#LemboSS13},
  volume = {7882},
  wpoptique = {WP4},
  year = {2013},
  yearoptique = {Y1}
}

Downloads: 0