TY - GEN A1 - Schenk, Simon A1 - Staab, Steffen T1 - Networked RDF graphs N2 - Networked graphs are defined in this paper as a small syntactic extension of named graphs in RDF. They allow for the definition of a graph by explicitly listing triples as well as by SPARQL queries on one or multiple other graphs. By this extension it becomes possible to define a graph including a view onto other graphs and to define the meaning of a set of graphs by the way they reference each other. The semantics of networked graphs is defined by their mapping into logic programs. The expressiveness and computational complexity of networked graphs, varying by the set of constraints imposed on the underlying SPARQL queries, is investigated. We demonstrate the capabilities of networked graphs by a simple use case. T3 - Arbeitsberichte, FB Informatik - 2007,3 KW - Resource Description Framework (RDF) KW - RDF Graphs Y1 - 2007 UR - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/113 UR - https://nbn-resolving.org/urn:nbn:de:kola-1136 ER -