Scalable Distributed Reasoning Using MapReduce
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
ISWC '09 Proceedings of the 8th International Semantic Web Conference
DLEJena: A practical forward-chaining OWL 2 RL reasoner combining Jena and Pellet
Web Semantics: Science, Services and Agents on the World Wide Web
When owl: sameAs isn't the same: an analysis of identity in linked data
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
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
Linked Data
Creating knowledge out of interlinked data
Semantic Web
OWLIM: A family of scalable semantic repositories
Semantic Web
OWL reasoning with WebPIE: calculating the closure of 100 billion triples
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Dealing with inconsistencies in linked data mashups
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Hi-index | 0.00 |
In this paper, we summarise the lessons learnt from the PhD Thesis Exploiting RDFS and OWL for Integrating Heterogeneous, Large-Scale, Linked Data Corpora where we looked at three use-cases for reasoning over Linked Data: (i) translating data between different vocabulary terms; (ii) identifying and repairing noise in the form of inconsistency; and (iii) detecting and processing coreferent identifiers (identifiers which refer to the same thing). We summarise how we overcome the challenges of scalability and robustness faced when reasoning over Linked Data. We validate our methods against an open-domain corpus of 1.1 billion quadruples crawled from 4 million Linked Data documents, discussing the applicability and utility of our reasoning methods in such scenarios.