document: 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 .
doc_bio_tags: O O O O O O O B B O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O