01073nas a2200193 4500008004100000245005900041210005900100300001400159520049700173653002300670653000800693653002400701100001800725700002000743700002700763700002000790700001800810856005100828 2014 eng d00aPushing the Boundaries of Tractable Ontology Reasoning0 aPushing the Boundaries of Tractable Ontology Reasoning a148–1633 a
We identify a class of Horn ontologies for which standard reasoning tasks such as instance checking and classification are tractable. The class is general enough to include the OWL 2 EL, QL, and RL profiles. 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 profile, and thus that polynomial time reasoning is possible for these ontologies.
10adescription logics10aOWL10aTractable Reasoning1 aCarral, David1 aFeier, Cristina1 aGrau, Bernardo, Cuenca1 aHitzler, Pascal1 aHorrocks, Ian uhttp://dx.doi.org/10.1007/978-3-319-11915-1_10