The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Robust and scalable Linked Data reasoning incorporating provenance and trust annotations
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 annotation values help ensure a more robust form of reasoning. We finally sketch, discuss and evaluate a use-case for a simple repair of inconsistencies detectable within OWL 2 RL/RDF constraint rules using ranking annotations to detect and defeat the “marginal view”, and in so doing, infer an empirical “consistency threshold” for the Web of Data in our setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A theory of diagnosis from first principles
Reiter, R. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90062-2 · Cited by 3,031 · cited 4×
“Firstly, we give: The Principle of Parsimony: A diagnosis is a conjecture that some minimal set of components are faulty [55].”
BackgroundMethodInfluentialHypertext Transfer Protocol -- HTTP/1.1
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., & Berners-Lee, T. (1999) · doi:10.17487/rfc2616 · Cited by 1,218
Green, T. J., Karvounarakis, G., & Tannen, V. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265535 · Cited by 812
Research works printed but not linked: 50
- Andrey Balmin, Vagelis Hristidis, Yannis apakonstantinou, Objectrank: authority-based keyword search in databases, in Proceedings of the 13th International Conference on Very Large Data Bases, 2004, pp. 564–575. · DOI · Paper page
- Tim Berners-Lee, Roy T. Fielding, Larry Masinter, Uniform Resource Identifier (URI): Generic Syntax. RFC 3986, January 2005. <http://tools.ietf.org/html/rfc3986>. · DOI · Paper page
- Barry Bishop, Atanas Kiryakov, Damyan Ognyanoff, Ivan Peikov, Zdravko Tashev, Ruslan Velkov, OWLIM: a family of scalable semantic repositories, Semantic Web Journal, in press. <http://www.semantic-web-journal.net/sites/default/files/swj97_0.pdf>.
- Stefano Bistarelli, Fabio Martinelli, Francesco Santini, Weighted Datalog and Levels of Trust, in: Proceedings of the The Third International Conference on Availability, Reliability and Security, ARES 2008, March 4–7, 2008, Technical University of Catalonia, Barcelona, Spain, pp. 1128–1134, 2008.
- Brin, 1998, The Anatomy of a Large-Scale Hypertextual Web Search Engine, Computer Networks, 30, 107
- Peter Buneman, Egor Kostylev, Annotation algebras for rdfs, in: The Second International Workshop on the role of Semantic Web in Provenance Management (SWPM-10), CEUR Workshop Proceedings, 2010.
- Cheney, 2009, Provenance in databases: why, how, and where, Foundations and Trends in Databases, 1, 379, 10.1561/1900000006 · DOI · Paper page
- Gong Cheng, Weiyi Ge, Honghan Wu, Yuzhong Qu, Searching Semantic Web Objects Based on Class Hierarchies, in: Proceedings of Linked Data on the Web Workshop, 2008.
- Gong Cheng, Yuzhong Qu, Term Dependence on the Semantic Web, in: International Semantic Web Conference, Oct 2008, pp. 665–680. · doi:10.1007/978-3-540-88564-1_42
- Jeffrey Dean, Sanjay Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, 2004, pp. 137–150.
- Renaud Delbru, Axel Polleres, Giovanni Tummarello, Stefan Decker, Context Dependent Reasoning for Semantic Documents in Sindice, in Proc. of Fourth SSWS Workshop, October 2008.
- Delbru, 2010, Hierarchical link analysis for ranking web data, ESWC, 225
- Li Ding, Rong Pan, Timothy W. Finin, Anupam Joshi, Yun Peng, Pranam Kolari, Finding and Ranking Knowledge on the Semantic Web, in: International Semantic Web Conference, 2005, pp. 156–170. · DOI · Paper page
- Dividino, 2009, Querying for provenance, trust, uncertainty and other meta knowledge in RDF, Journal of Web Semantics, 7, 204, 10.1016/j.websem.2009.07.004 · DOI
- 2009, W3C Working Draft
- Orri Erling, Ivan Mikhailov, RDF Support in the Virtuoso DBMS, in: Networked Knowledge – Networked Media, volume 221 of Studies in Computational Intelligence, Springer, 2009, pp. 7–24. · DOI · Paper page
- Fang, 2008, Scalable distributed ontology reasoning using dht-based partitioning, ASWC, 91
- Giorgos Flouris, Irini Fundulaki, Panagiotis Pediaditis, Yannis Theoharis, Vassilis Christophides. Coloring RDF Triples to Capture Provenance, in: The Semantic Web – ISWC 2009, Eighth International Semantic Web Conference, ISWC 2009, Chantilly, VA, USA, Proceedings, October 25–29, 2009, pp. 196–212. · DOI
- Thomas Franz, Antje Schultz, Sergej Sizov, Steffen Staab, Triplerank: Ranking semantic web data by tensor decomposition, in: International Semantic Web Conference, 2009, pp. 213–228. · DOI · Paper page
- B. Grosof, I. Horrocks, R. Volz, S. Decker. Description Logic Programs: Combining Logic Programs with Description Logic, in: 13th International Conference on World Wide Web, 2004. · DOI · Paper page
- Christophe Guéret, Paul T. Groth, Frank van Harmelen, and Stefan Schlobach. Finding the Achilles Heel of the Web of Data: Using Network Analysis for Link-Recommendation, in: International Semantic Web Conference (1), 2010, pp. 289–304. · DOI
- Andreas Harth, Sheila Kinsella, Stefan Decker, Using Naming Authority to Rank Data and Ontologies for Web Search. In International Semantic Web Conference, 2009, pp. 277–292. · doi:10.1007/978-3-642-04930-9_18
- Hitzler, 2010, A reasonable semantic web, Semantic Web Journal, 1
- Aidan Hogan. Exploiting RDFS and OWL for Integrating Heterogeneous, Large-Scale, Linked Data Corpora. PhD thesis, Digital Enterprise Research Institute, National University of Ireland, Galway, 2011. <http://aidanhogan.com/docs/thesis/>.
- Aidan Hogan, Andreas Harth, Stefan Decker, ReConRank: A Scalable Ranking Method for Semantic Web Data with Context, in: Second Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS2006), 2006.
- Aidan Hogan, Andreas Harth, Stefan Decker, Performing Object Consolidation on the Semantic Web Data Graph, in: First I3 Workshop: Identity, Identifiers, Identification Workshop, 2007.
- Hogan, 2009, Scalable authoritative OWL reasoning for the Web, International Journal of Semantic Web Information System, 5, 49, 10.4018/jswis.2009040103 · DOI
- Aidan Hogan, Jeff Z. Pan, Axel Polleres, Stefan Decker, SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples, in: International Semantic Web Conference, 2010. · DOI
- Huang, 2005, Reasoning with inconsistent ontologies, IJCAI, 454
- Kalyanpur, 2006, Repairing unsatisfiable concepts in owl ontologies, ESWC, 170
- Kifer, 1992, Theory of Generalized Annotated Logic Programming and its Applications, Journal of Logic Programming, 12
- Kleinberg, 1999, Authoritative sources in a hyperlinked environment, Journal of the ACM, 46, 604, 10.1145/324133.324140 · DOI · Paper page
- Kohlschütter, 2006, Efficient parallel computation of PageRank, ECIR, 241
- Vladimir Kolovski, Zhe Wu, George Eadon, Optimizing Enterprise-scale OWL 2 RL Reasoning in a Relational Database System, in: International Semantic Web Conference, 2010. · doi:10.1007/978-3-642-17746-0_28
- Kotoulas, 2010, Mind the data skew: distributed inferencing by speeddating in elastic regions, WWW, 531
- Nuno Lopes, Axel Polleres, Umberto Straccia, Antoine Zimmermann, AnQL: SPARQLing Up Annotated RDFS, in: The Semantic Web – ISWC 20010, Ninth International Semantic Web Conference, ISWC 2010, Shangai, Cina, November 7–11, to appear, Proceedings, 2010. · DOI
- Lukasiewicz, 2008, Managing uncertainty and vagueness in description logics for the Semantic Web, Journal of Web Semantics, 6, 291, 10.1016/j.websem.2008.04.001 · DOI · Paper page
- Yue Ma, Pascal Hitzler, Paraconsistent reasoning for owl 2, in: Third International Conference on Web Reasoning and Rule Systems (RR2009), 2009, pp. 197–211. · doi:10.1007/978-3-642-05082-4_14
- Ma, 2007, Algorithms for Paraconsistent Reasoning with OWL, ESWC, 399
- 2009, vol. 7 3
- Qi, 2011, Extending description logics with uncertainty reasoning in possibilistic logic, International Journal of Intelligent Systems, 26, 353, 10.1002/int.20470 · doi:10.1002/int.20470
- Schlobach, 2007, Debugging incoherent terminologies, Journal of Automatic Reasoning, 39, 317, 10.1007/s10817-007-9076-z · DOI · Paper page
- Stonebraker, 1986, The Case for Shared Nothing, IEEE Database Engineering Bulltein, 9, 4
- Stuckenschmidt, 2008, Debugging owl ontologies – a reality check, EON
- Urbani, 2010, OWL reasoning with WebPIE: calculating the closure of 100 billion triples, ESWC, 213
- Urbani, 2009, Scalable distributed reasoning using MapReduce, International Semantic Web Conference, 634
- Vrandečíc, 2010, Leveraging non-lexical knowledge for the linked open data web, Review of April Fool’s day Transactions (RAFT), 5, 18
- Weaver, 2009, Parallel materialization of the finite RDFS closure for hundreds of millions of triples, International Semantic Web Conference (ISWC2009), 682
- Yardeni, 1991, A Type System for Logic Programs, Journal of Logic Programming, 10, 125, 10.1016/0743-1066(91)80002-U · DOI
- Zhang, 2009, A tableau algorithm for handling inconsistency in OWL, ESWC, 399
Cited by
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
Self-citationZaveri, A., Rula, A., Maurino, A., Pietrobon, R., Lehmann, J., & Auer, S. (2015) · Semantic Web · doi:10.3233/sw-150175 · Cited by 596
Metadata
- Authors
- Bonatti, P. A., Hogan, A., Polleres, A., & Sauro, L.
- Venue
- Journal of Web Semantics
- Publisher
- Elsevier BV
- Published
- 2011-07
- Volume
- 9
- Issue
- 2
- Pages
- 165-201
- ISSN
- 1570-8268
- Cited by
- 42
- References
- 3
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Funders
- Science Foundation Ireland (SFI/08/CE/I1380)
- IRCSET
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.