Pushing the boundaries of tractable ontology reasoning
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.
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.
[PDF][PDF] Pushing the Boundaries of Tractable Ontology Reasoning
B Cuenca Grau - 2014 - cs.ox.ac.uk
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.
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.
以上显示的是最相近的搜索结果。 查看全部搜索结果