Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Proceedings of the 17th international conference on World Wide Web
Web Semantics: Science, Services and Agents on the World Wide Web
Mind the data skew: distributed inferencing by speeddating in elastic regions
Proceedings of the 19th international conference on World wide web
SAOR: template rule optimisations for distributed reasoning over 1 billion linked data triples
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Optimizing enterprise-scale OWL 2 RL reasoning in a relational database system
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
OWLIM: A family of scalable semantic repositories
Semantic Web
WebPIE: A Web-scale Parallel Inference Engine using MapReduce
Web Semantics: Science, Services and Agents on the World Wide Web
Efficient rule-based inferencing for OWL EL
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
The lightweight ontology language OWL RL is used for reasoning with large amounts of data. To this end, the W3C standard provides a simple system of deduction rules, which operate directly on the RDF syntax of OWL. Several similar systems have been studied. However, these approaches are usually complete for instance retrieval only. This paper asks if and how such methods could also be used for computing entailed subclass relationships. Checking entailment for arbitrary OWL RL class subsumptions is co-NP-hard, but tractable rule-based reasoning is possible when restricting to subsumptions between atomic classes. Surprisingly, however, this cannot be achieved in any RDF-based rule system, i.e., the W3C calculus cannot be extended to compute all atomic class subsumptions. We identify syntactic restrictions to mitigate this problem, and propose a rule system that is sound and complete for many OWL RL ontologies.