Abstract
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.
Cite
CITATION STYLE
Carral, D., Feier, C., Grau, B. C., Hitzler, P., & Horrocks, I. (2014). Pushing the boundaries of tractable ontology reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8797, pp. 148–163). Springer Verlag. https://doi.org/10.1007/978-3-319-11915-1_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
