Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web

Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reuse and recombination of RDF data today is mostly done using data replication and procedural code. A simple declarative mechanism for reusing and combining RDF data would help users to generate content for the semantic web. Having such a mechanism, the Semantic Web could better benefit from user generated content, as it is broadly present in the so called Web 2.0, but also from better linkage of existing content. We propose Networked Graphs, which allow users to define RDF graphs both, by extensionally listing content, but also by using views on other graphs. These views can be used to include parts of other graphs, to transform data before including it and to denote rules. The relationships between graphs are described declaratively using SPARQL queries and an extension of the SPARQL semantics. Networked Graphs are easily exchangeable between and interpretable on different computers. Using existing protocols, Networked Graphss can be evaluated in a distributed setting.

[1]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[2]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[3]  Daniel Oberle,et al.  Implementing views for light-weight Web ontologies , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[4]  Vassilis Christophides,et al.  Viewing the Semantic Web through RVL Lenses , 2003, SEMWEB.

[5]  Frank van Harmelen,et al.  Contextualizing ontologies , 2004, J. Web Semant..

[6]  H. Lan,et al.  SWRL : A semantic Web rule language combining OWL and ruleML , 2004 .

[7]  Serge Abiteboul,et al.  Positive active XML , 2004, PODS '04.

[8]  Lalana Kagal,et al.  N3logic: A logic for the web , 2004 .

[9]  David Maier,et al.  From databases to dataspaces: a new abstraction for information management , 2005, SGMD.

[10]  Jeremy J. Carroll,et al.  Named graphs, provenance and trust , 2005, WWW '05.

[11]  P. Bouquet,et al.  RDF and Contexts : Use of SPARQL and Named Graphs to Achieve Contextualization , 2006 .

[12]  Wolfgang Nejdl,et al.  A distributed tabling algorithm for rule based policy systems , 2006, Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06).

[13]  Marcelo Arenas,et al.  Semantics and Complexity of SPARQL , 2006, International Semantic Web Conference.

[14]  Steffen Staab,et al.  Networked RDF graphs , 2007 .

[15]  Simon Schenk,et al.  A SPARQL Semantics Based on Datalog , 2007, KI.

[16]  Bijan Parsia,et al.  SPARQL-DL: SPARQL Query for OWL-DL , 2007, OWLED.

[17]  Axel Polleres,et al.  From SPARQL to rules (and back) , 2007, WWW '07.

[18]  Siegfried Handschuh,et al.  Distributed Knowledge Representation on the Social Semantic Desktop: Named Graphs, Views and Roles in NRL , 2007, ESWC.