DMCA
Robust and Scalable Linked Data Reasoning Incorporating Provenance and Trust Annotations (2011)
| Citations: | 24 - 6 self |
BibTeX
@MISC{Bonatti11robustand,
author = {Piero A. Bonatti and Aidan Hogan and Axel Polleres and Luigi Sauro},
title = {Robust and Scalable Linked Data Reasoning Incorporating Provenance and Trust Annotations},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we leverage annotated logic programs for tracking indicators of provenance and trust during reasoning, specifically focussing on the use-case of applying a scalable subset of OWL 2 RL/RDF rules over static corpora of arbitrary Linked Data (Web data). Our annotations encode three facets of information: (i) blacklist: a (possibly manually generated) boolean annotation which indicates that the referent data are known to be harmful and should be ignored during reasoning; (ii) ranking: a numeric value derived by a PageRank-inspired technique—adapted for Linked Data—which determines the centrality of certain data artefacts (such as RDF documents and statements); (iii) authority: a boolean value which uses Linked Data principles to conservatively determine whether or not some terminological information can be trusted. We formalise a logical framework which annotates inferences with the strength of derivation along these dimensions of trust and provenance; we formally demonstrate some desirable properties of the deployment of annotated logic programming in our setting, which guarantees (i) a unique minimal model (least fixpoint); (ii) monotonicity; (iii) finitariness; and (iv) finally decidability. In so doing, we also give some formal results which reveal strategies for scalable and efficient implementation of various reasoning tasks one might consider. Thereafter, we discuss scalable and distributed implementation strategies for applying our ranking and reasoning methods over a cluster of commodity hardware; throughout, we provide evaluation of our methods over 1 billion Linked Data quadruples crawled from approximately 4 million individual Web documents, empirically demonstrating the scalability of our approach, and how our
Keyphrases
trust annotation efficient implementation linked data numeric value rl rdf rule terminological information desirable property static corpus boolean annotation distributed implementation strategy data quadruple logical framework boolean value linked data principle scalable subset certain data artefact individual web document logic program formal result web data unique minimal model rdf document referent data pagerank-inspired technique annotated logic programming commodity hardware
