Graph-based Ontology Classi

author: Valerio Santarelli, Department of Computer and System Sciences Antonio Ruberti, Sapienza University of Rome
published: July 8, 2013,   recorded: May 2013,   views: 60
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Ontology classi cation 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 pro le of OWL 2 for which ontology classi cation is polynomial in the size of the ontology TBox. However, to date, no ecient methods and implementations speci cally tailored to OWL 2 QL ontologies have been developed. In this paper, we provide a new algorithm for ontology classi cation 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 classi cation of OWL 2 QL ontologies.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: