Pushing the Boundaries of Tractable Ontology Reasoning
published: Dec. 19, 2014, recorded: October 2014, views: 32
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.
We identify a class of Horn ontologies for which standard reasoning tasks such as instance checking and classiﬁcation are tractable. The class is general enough to include the OWL 2 EL, QL, and RL proﬁles. Verifying whether a Horn ontology belongs to the class can be done in polynomial time. We show empirically that the class includes many real-world ontologies that are not included in any OWL 2 proﬁle, and thus that polynomial time reasoning is possible for these ontologies.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !