The Semantic Web consists of many RDF graphs nameable by
URIs. This paper extends the syntax and semantics of RDF to cover
such Named Graphs. This enables RDF statements that describe
graphs, which is beneficial in many Semantic Web application areas.
As a case study, we explore the application area 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 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. The extension of
RDF to Named Graphs provides a formally defined framework to
be a foundation for the Semantic Web trust layer.
%0 Conference Paper
%1 carroll_named_2005-1
%A Carroll, Jeremy
%A Bizer, Chris
%A Hayes, Pat
%A Stickler, Patrick
%B WWW2005
%C Tokyo, Japan
%D 2005
%I ACM Press
%K RDF named_graphs nicetagbib semantic_web sparql
%T Named Graphs, Provenance and Trust
%U http://www2005.org/cdrom/docs/p613.pdf
%X The Semantic Web consists of many RDF graphs nameable by
URIs. This paper extends the syntax and semantics of RDF to cover
such Named Graphs. This enables RDF statements that describe
graphs, which is beneficial in many Semantic Web application areas.
As a case study, we explore the application area 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 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. The extension of
RDF to Named Graphs provides a formally defined framework to
be a foundation for the Semantic Web trust layer.
@inproceedings{carroll_named_2005-1,
abstract = {The Semantic Web consists of many {RDF} graphs nameable by
{URIs.} This paper extends the syntax and semantics of {RDF} to cover
such Named Graphs. This enables {RDF} statements that describe
graphs, which is beneficial in many Semantic Web application areas.
As a case study, we explore the application area 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 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. The extension of
{RDF} to Named Graphs provides a formally defined framework to
be a foundation for the Semantic Web trust layer.},
added-at = {2009-10-04T01:49:12.000+0200},
address = {Tokyo, Japan},
author = {Carroll, Jeremy and Bizer, Chris and Hayes, Pat and Stickler, Patrick},
biburl = {https://www.bibsonomy.org/bibtex/2aa20d419687bb6751ef46b058ae8bdc5/davids},
booktitle = {{WWW2005}},
interhash = {08bc9a46b23bc08268c7ad56629e8075},
intrahash = {aa20d419687bb6751ef46b058ae8bdc5},
keywords = {RDF named_graphs nicetagbib semantic_web sparql},
publisher = {{ACM} Press},
timestamp = {2009-10-16T21:52:32.000+0200},
title = {Named Graphs, Provenance and Trust},
url = {http://www2005.org/cdrom/docs/p613.pdf},
year = 2005
}