- From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
- Date: Tue, 06 Apr 2004 16:21:11 +0100
- To: Jeremy Carroll <jjc@hplb.hpl.hp.com>
- Cc: Patrick Stickler <patrick.stickler@Nokia.com>, www-archive@w3.org, ext Chris Bizer <chris@bizer.de>, Pat Hayes <phayes@ihmc.us>
After chatting with Chris ... > Take 1: > Abstract: > > The Semantic Web consists of many RDF graphs named > by URIs. This paper discusses the syntax and semantics > of such collections of named graphs. This enables > improved clarity in Semantic Web > publishing, allowing publishers to communicate > assertional intent, and to sign their graphs. > Information consumers can evaluate specific graphs > using task-specific trust policies, and act on the > information from those named graphs that they accept. > > Take 2: The Semantic Web consists of many RDF graphs named by URIs. This paper extends the syntax and semantics of RDF to cover such collections of named graphs. This enables RDF statements that describe graphs, which can be used in many Semantic Web applications. We explore in detail the important application of Semantic Web publishing: named graphs allow publishers to communicate assertional intent, and to sign their graphs; information consumers can evaluate specific graphs using task-specific trust policies, and act on the information from those named graphs that they accept. Graphs are trusted depending on: their content; information about the graph; and the task the user is performing. (Chris noted that we needed to be clear that the paper is trying to rebuild the RDF stack, and should be more explicit about the wide applicability). Jeremy
Received on Tuesday, 6 April 2004 11:22:21 UTC