Graph-based Ontology Classi
published: July 8, 2013, recorded: May 2013, views: 2690
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Ontology classication 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 prole of OWL 2 for which ontology classication is polynomial in the size of the ontology TBox. However, to date, no ecient methods and implementations specically tailored to OWL 2 QL ontologies have been developed. In this paper, we provide a new algorithm for ontology classication 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 classication of OWL 2 QL ontologies.
Download slides: eswc2013_santarelli_ontology_classication_01.pdf (6.5 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !