--- a/rdf-dataset/Overview.html Mon Dec 16 01:50:45 2013 +0100
+++ b/rdf-dataset/Overview.html Mon Dec 16 01:52:39 2013 +0100
@@ -343,10 +343,12 @@
<p>The <a href="http://www.w3.org/TR/rdf11-concepts/">Resource Description Framework (RDF)</a> version 1.1 defines the concept of RDF datasets, a notion introduced first by the SPARQL specification [<cite><a class="bibref" href="#bib-RDF-SPARQL-QUERY">RDF-SPARQL-QUERY</a></cite>]. An RDF dataset is defined as a collection of <a title="RDF graph" href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graphs</a> where all but one are <a title="named graph" href="http://www.w3.org/TR/rdf11-concepts/#dfn-named-graph">named graphs</a> associated with an <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRI</a> or <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-blank-node">blank node</a> (the <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-graph-name">graph name</a>), and the unnamed default graph [<cite><a class="bibref" href="#bib-RDF11-CONCEPTS">RDF11-CONCEPTS</a></cite>]. Given that RDF is a data model equipped with a formal semantics [<cite><a class="bibref" href="#bib-RDF11-MT">RDF11-MT</a></cite>], it is natural to try and define what the semantics of datasets should be.</p>
- <p>The RDF Working Group was initially chartered to provide such semantics in its recommendation:</p>
- <blockquote cite="http://www.w3.org/2011/01/rdf-wg-charter">
+ <p>The RDF Working Group was <a "="" href="http://www.w3.org/2011/01/rdf-wg-charter">chartered</a>
+ to provide such semantics in its recommendation:</p>
+ <blockquote>
<h2 id="required-features">Required features</h2>
- <ul><li id="ng">Standardize a model and semantics for multiple graphs and graphs stores [...]</li></ul>
+ <ul><li id="ng">Standardize a model and semantics for multiple graphs and graphs stores
+ [...]</li></ul>
</blockquote>
<p>However, discussions within the Working Group revealed that very different assumptions currently exist among practitioners, who are using RDF datasets with their own intuition of the meaning of datasets. Defining the semantics of RDF datasets requires an understanding of the two following issues:</p>
@@ -391,7 +393,7 @@
<p>We first take a look at existing specifications that could shed a light on how the semantics of datasets should be defined. There are three important documents that closely relate to the issue:</p>
<ul>
<li>the RDF semantics, as standardized in 2004 [<cite><a class="bibref" href="#bib-RDF-MT">RDF-MT</a></cite>] and its revision in 2013 [<cite><a class="bibref" href="#bib-RDF11-MT">RDF11-MT</a></cite>];</li>
- <li>the article <i>Named Graphs</i> by Carroll et al. [<cite><a class="bibref" href="#bib-NAMED-GRAPHS">NAMED-GRAPHS</a></cite>], which first introduced the term “named graph” and contains a section on formal semantics;</li>
+ <li>the article <i>Named Graphs</i> by Carroll et al. [<cite><a class="bibref" href="#bib-CARROLL-05">CARROLL-05</a></cite>], which first introduced the term “named graph” and contains a section on formal semantics;</li>
<li>the SPARQL specification [<cite><a class="bibref" href="#bib-RDF-SPARQL-QUERY">RDF-SPARQL-QUERY</a></cite>], which defines RDF datasets and how to query them.</li>
</ul>
@@ -411,7 +413,7 @@
<section id="sec-named-graph-paper" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter">
<h3 id="named-graph" aria-level="2" role="heading"><span class="secno">2.2 </span>The Named Graphs paper</h3>
- <p>In Carroll et al. [<cite><a class="bibref" href="#bib-NAMED-GRAPHS">NAMED-GRAPHS</a></cite>], a named graph is defined as a pair comprising an IRI and an RDF graph. The notion of RDF interpretation is extended to named graphs by saying that the graph IRI in the pair must denote the pair itself. This non-ambiguously answers the question of what the graph IRI denotes. This can then be used to define proper dataset semantics, as shown in Section 3.3. Note that it is deliberate that the graph IRI is forced to denote the pair rather than the RDF graph. This is done in order to differentiate two occurrences of the same RDF graph that could have been published at different times, or authored by different people. A simple reference to the RDF graph would simply identify a mathematical set, which is the same wherever it occurs.</p>
+ <p>In Carroll et al. [<cite><a class="bibref" href="#bib-CARROLL-05">CARROLL-05</a></cite>], a named graph is defined as a pair comprising an IRI and an RDF graph. The notion of RDF interpretation is extended to named graphs by saying that the graph IRI in the pair must denote the pair itself. This non-ambiguously answers the question of what the graph IRI denotes. This can then be used to define proper dataset semantics, as shown in Section 3.3. Note that it is deliberate that the graph IRI is forced to denote the pair rather than the RDF graph. This is done in order to differentiate two occurrences of the same RDF graph that could have been published at different times, or authored by different people. A simple reference to the RDF graph would simply identify a mathematical set, which is the same wherever it occurs.</p>
</section>
<section id="sec-sparql" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter">
@@ -438,7 +440,7 @@
<li>they define notions of interpretation and entailment in function of the corresponding notions in RDF Semantics.</li>
</ul>
- <p>The first item above reflects the indication given in [<cite><a class="bibref" href="#bib-RDF11-MT">RDF11-MT</a></cite>] with respect to dataset semantics: <q cite="http://www.w3.org/TR/rdf11-mt/#rdf-datasets">a dataset <em class="rfc2119" title="SHOULD">SHOULD</em> be understood to have at least the same content as its default graph</q>.</p>
+ <p>The first item above reflects the indication given in [<cite><a class="bibref" href="#bib-RDF11-MT">RDF11-MT</a></cite>] (Section <a href="http://www.w3.org/TR/rdf11-mt/#rdf-datasets">"RDF Datasets"</a>) with respect to dataset semantics: <q>a dataset <em class="rfc2119" title="SHOULD">SHOULD</em> be understood to have at least the same content as its default graph</q>.</p>
<p>The dependency on RDF semantics is such that most of the dataset semantics below reuse RDF semantics as a black box. More precisely, it is not necessary to be specific about how truth of RDF graphs is defined as long as there is a notion of interpretation that determines the truth of a set of triples. In fact, RDF Semantics does not define a single formal semantics, but multiple ones, depending on what standard vocabularies are endorsed by an application (such as the RDF, RDFS, XSD vocabularies). Consequently, we parameterize most of the definitions below with an unspecified entailment regime <var>E</var>. RDF 1.1 defines the following entailment regimes: simple entailment, D-entailment, RDF-entailment, RDFS-entailment. Additionally, OWL defines two other entailment regimes, based on the OWL 2 direct semantics [<cite><a class="bibref" href="#bib-OWL2-DIRECT-SEMANTICS">OWL2-DIRECT-SEMANTICS</a></cite>] and the OWL 2 RDF-based semantics [<cite><a class="bibref" href="#bib-OWL2-RDF-BASED-SEMANTICS">OWL2-RDF-BASED-SEMANTICS</a></cite>].</p>
<p>For an entailment regime <var>E</var>, we will say <var>E</var>-interpretation, <var>E</var>-entailment, <var>E</var>-equivalence, <var>E</var>-consistency to describe the notions of interpretations, entailment, equivalence and consistency associated with the regime <var>E</var>. Similarly, we will use the terms dataset-interpretation, dataset-entailment, dataset-equivalence, dataset-consistency for the corresponding notions in dataset semantics.</p>
@@ -707,9 +709,6 @@
<p>Communication of the intended semantics could be performed in various ways, from having the author tell the consumers directly, to inventing a protocol for this. Use of the HTTP protocol and content negotiation could be a possible way too. Special syntactic markers in the concrete serialization of datasets could convey the intended meaning. All of those are solutions that do not follow current practices.</p>
</section>
-<section id="references" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter">
-</section>
-
<section id="changes" class="appendix informative" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter">
<!--OddPage-->
@@ -725,14 +724,12 @@
-
-
<section class="appendix" id="references" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter">
<!--OddPage-->
<h2 aria-level="1" role="heading" id="h2_references"><span class="secno">B. </span>References</h2><section id="informative-references" typeof="bibo:Chapter" resource="#ref" rel="bibo:Chapter"><h3 aria-level="2" role="heading" id="h3_informative-references"><span class="secno">B.1 </span>Informative references</h3><dl class="bibliography" about=""><dt id="bib-ANNOTATED-RDF">[ANNOTATED-RDF]</dt><dd rel="dcterms:references">Octavian Udrea, Diego Reforgiato Recupero, V. S. Subrahmanian. <cite>Annotated RDF.</cite> In The Semantic Web: Research and Applications, 3rd European Semantic Web Conference, ESWC 2006, Budva, Montenegro, June 11-14, 2006, Proceedings. Springer, LNCS 4011, pp. 487-501
-</dd><dt id="bib-DELBRU-ET-AL-2008">[DELBRU-ET-AL-2008]</dt><dd rel="dcterms:references">Renaud Delbru, Axel Polleres, Giovanni Tummarello, Stefan Decker. <cite>Context Dependent Reasoning for Semantic Documents in Sindice.</cite> In Proceedings of the 4th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS). Karlsruhe, Germany, 2008.
+</dd><dt id="bib-CARROLL-05">[CARROLL-05]</dt><dd rel="dcterms:references">Jeremy J. Carroll, Christian Bizer, Patrick J. Hayes and Patrick Stickler. <cote><a href="http://wifo5-03.informatik.uni-mannheim.de/bizer/SWTSGuide/carroll-ISWC2004.pdf">Named Graphs, Provenance and Trust</a>. Proc. 14th Int. Conf. on World Wide Web, WWW 2005, Chiba, Japan, May 10-14, 2005, pp. 613-622.
+</cote></dd><dt id="bib-DELBRU-ET-AL-2008">[DELBRU-ET-AL-2008]</dt><dd rel="dcterms:references">Renaud Delbru, Axel Polleres, Giovanni Tummarello, Stefan Decker. <cite>Context Dependent Reasoning for Semantic Documents in Sindice.</cite> In Proceedings of the 4th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS). Karlsruhe, Germany, 2008.
</dd><dt id="bib-FUZZY-RDF">[FUZZY-RDF]</dt><dd rel="dcterms:references">Umberto Straccia. <cite>A Minimal Deductive System for General Fuzzy RDF.</cite> In Web Reasoning and Rule Systems, Third International Conference, RR 2009, Chantilly, VA, USA, October 25-26, 2009, Proceedings. Springer, LNCS 5837, pp. 166-181
-</dd><dt id="bib-NAMED-GRAPHS">[NAMED-GRAPHS]</dt><dd rel="dcterms:references">Jeremy J. Carroll; Chris Bizer; Pat Hayes; Patrick Stickler. <a href="http://sites.wiwiss.fu-berlin.de/suhl/bizer/SWTSGuide/carroll-ISWC2004.pdf"><cite>Named Graphs, Provenance and Trust</cite></a>. The Semantic Web — ISWC2004, Yokohama, Springer–Verlag, 2005. URL: <a href="http://sites.wiwiss.fu-berlin.de/suhl/bizer/SWTSGuide/carroll-ISWC2004.pdf">http://sites.wiwiss.fu-berlin.de/suhl/bizer/SWTSGuide/carroll-ISWC2004.pdf</a>.
</dd><dt id="bib-OWL2-DIRECT-SEMANTICS">[OWL2-DIRECT-SEMANTICS]</dt><dd rel="dcterms:references">Boris Motik; Peter Patel-Schneider; Bernardo Cuenca Grau. <a href="http://www.w3.org/TR/owl2-direct-semantics/"><cite>OWL 2 Web Ontology Language Direct Semantics (Second Edition)</cite></a>. 11 December 2012. W3C Recommendation. URL: <a href="http://www.w3.org/TR/owl2-direct-semantics/">http://www.w3.org/TR/owl2-direct-semantics/</a>
</dd><dt id="bib-OWL2-RDF-BASED-SEMANTICS">[OWL2-RDF-BASED-SEMANTICS]</dt><dd rel="dcterms:references">Michael Schneider. <a href="http://www.w3.org/TR/owl2-rdf-based-semantics/"><cite>OWL 2 Web Ontology Language RDF-Based Semantics (Second Edition)</cite></a>. 11 December 2012. W3C Recommendation. URL: <a href="http://www.w3.org/TR/owl2-rdf-based-semantics/">http://www.w3.org/TR/owl2-rdf-based-semantics/</a>
</dd><dt id="bib-RDF-MT">[RDF-MT]</dt><dd rel="dcterms:references">Patrick Hayes. <a href="http://www.w3.org/TR/rdf-mt/"><cite>RDF Semantics</cite></a>. 10 February 2004. W3C Recommendation. URL: <a href="http://www.w3.org/TR/rdf-mt/">http://www.w3.org/TR/rdf-mt/</a>