Named Graphs, Provenance and Trust

by: Jeremy J Carroll, Christian Bizer, Pat Hayes, Patrick Stickler

(2005), pp. 613-622.

View FullText article

ACM, DOI

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

schaal, vme64, nmoreau, lillejul, AlisonBabeu, diogomartins, vlasovskikh, L3S (group), philb, sengcy, dansullivanblk

Find related articles with these CiteULike tags

annotation, context, data-integration, data-provenance, graph, named_graph, named-graphs, oai-ore, ontology, provenance, rdf, scope, security, semantic, semanticweb, semantic-web, semweb, signature, trust, uris, visual-information-seeking, web

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.

@inproceedings{citeulike:432248, 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.}, address = {New York, NY, USA}, author = {Carroll, Jeremy J. and Bizer, Christian and Hayes, Pat and Stickler, Patrick }, booktitle = {WWW '05: Proceedings of the 14th international conference on World Wide Web}, citeulike-article-id = {432248}, doi = {http://dx.doi.org/10.1145/1060745.1060835}, isbn = {1595930469}, keywords = {named\_graph, provenance, rdf}, pages = {613--622}, posted-at = {2008-04-22 15:39:19}, priority = {0}, publisher = {ACM Press}, title = {Named Graphs, Provenance and Trust}, url = {http://dx.doi.org/10.1145/1060745.1060835}, year = {2005} }

RIS record

TY - CONF ID - citeulike:432248 L3 - citeulike-article-id:432248 TI - Named Graphs, Provenance and Trust T2 - WWW '05: Proceedings of the 14th international conference on World Wide Web SP - 613 EP - 622 AD - New York, NY, USA PB - ACM Press SN - 1595930469 N2 - 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. KW - named_graph KW - provenance KW - rdf AU - Carroll, Jeremy AU - Bizer, Christian AU - Hayes, Pat AU - Stickler, Patrick PY - 2005/// UR - http://dx.doi.org/10.1145/1060745.1060835 ER -

RIS BibTeX