Named graphs as a mechanism for reasoning about provenance

24Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Named Graphs is a simple, compatible extension to the RDF abstract syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF reification, or knowledge-base specific extensions including quads and contexts. In this paper we demonstrate the use of Named Graphs and our experiences developing new kinds of semantic web application that build on Named Graphs for digital signatures, provenance, and semantic reasoning. We present a working example based on the Named Graphs for Jena (NG4J) API, from which we developed a semantic version control system for Software Engineering capable of reasoning about Named Graph-based provenance. We go on to discuss the implications of Named Graphs for Description Logics and semantic inference strategies. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Watkins, E. R., & Nicole, D. A. (2006). Named graphs as a mechanism for reasoning about provenance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3841 LNCS, pp. 943–948). https://doi.org/10.1007/11610113_99

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free