--- a/rdf-dataset/index.html Sun Dec 15 22:59:35 2013 +0100
+++ b/rdf-dataset/index.html Sun Dec 15 23:08:12 2013 +0100
@@ -142,7 +142,7 @@
<section id="sec-introduction">
<h2 id="introduction">Introduction</h2>
- <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 [[RDF-SPARQL-QUERY]]. An RDF dataset is defined as a collection of <a title="RDF graph">RDF graphs</a> where all but one are <a title="named graph">named graphs</a> associated with an <a>IRI</a> or <a>blank node</a> (the <a>graph name</a>), and the unnamed default graph [[RDF11-CONCEPTS]]. Given that RDF is a data model equipped with a formal semantics [[RDF11-MT]], it is natural to try and define what the semantics of datasets should be.</p>
+ <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 [[RDF-SPARQL-QUERY]]. An RDF dataset is defined as a collection of <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph" title="RDF graph">RDF graphs</a> where all but one are <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-named-graph" title="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 [[RDF11-CONCEPTS]]. Given that RDF is a data model equipped with a formal semantics [[RDF11-MT]], it is natural to try and define what the semantics of datasets should be.</p>
<p>The RDF 1.1 Working Group was initially chartered to provide such semantics in its recommendation:</p>
<blockquote cite="http://www.w3.org/2011/01/rdf-wg-charter">
@@ -276,7 +276,7 @@
<h4 id="f2-1" class="formal">Formalization: first version</h4>
<p>We define a dataset-interpretation with respect to an entailment regime <var>E</var> as an <var>E</var>-interpretation. Given a dataset-interpretation <var>I</var> and a dataset <var>D</var> having default graph <var>G</var> and named graphs <var>NG</var>, <var>I(D)</var> is true if and only if <var>I(G)</var> is true and for all <var>ng</var> in <var>NG</var>, <var>I(ng)</var> is true.</p>
- <p>This is equivalent to <var>I(D)</var> is true if <var>I(H)</var> is true where <var>H</var> is the <a>merge</a> of all the RDF graphs, named or default, appearing in <var>D</var>.</p>
+ <p>This is equivalent to <var>I(D)</var> is true if <var>I(H)</var> is true where <var>H</var> is the <a href="http://www.w3.org/TR/rdf11-mt/#dfn-merge">merge</a> of all the RDF graphs, named or default, appearing in <var>D</var>.</p>
<h4 id="f2-2" class="formal">Formalization: second version</h4>
<p>We define a dataset-interpretation with respect to an entailment regime <var>E</var> as an <var>E</var>-interpretation. Given a dataset-interpretation <var>I</var> and a dataset <var>D</var> having default graph <var>G</var> and named graphs <var>NG</var>, <var>I(D)</var> is true if and only if <var>I(H)</var> is true where <var>H</var> is the union of all the RDF graphs, named or default, appearing in <var>D</var>.</p>
@@ -302,7 +302,7 @@
<section>
<h3 id="naming">The graph name denotes the named graph or the graph</h3>
- <p>It is common to use the graph name as a way to identify the RDF graph inside the named graphs, or rather, to identify a particular occurrence of the graph. This allows one to describe the graph or the graph source in triples. For instance, one may want to say who the creator of a particular occurrence of a graph is. Assuming this semantics for graph names amounts to say that each named graph pair is an assertion that sets the <a>referent</a> of the graph name to be the associated graph or named graph pair.</p>
+ <p>It is common to use the graph name as a way to identify the RDF graph inside the named graphs, or rather, to identify a particular occurrence of the graph. This allows one to describe the graph or the graph source in triples. For instance, one may want to say who the creator of a particular occurrence of a graph is. Assuming this semantics for graph names amounts to say that each named graph pair is an assertion that sets the <a href="http://www.w3.org/TR/rdf11-concepts/#dfn-referent">referent</a> of the graph name to be the associated graph or named graph pair.</p>
<p class="issue">The following paragraph refers to speech and asserting, while dataset semantics never refers to such notions. This may be confusing.</p>
<p>Intuitively, this semantics can be seen as quoting the RDF graphs inside the named graphs. In this sense, <code>:alice {:bob :is :smart}</code> has to be understood as <q>Alice said: “Bob is smart”</q> which does not entail <q>Alice said: “Bob is intelligent”</q> because Alice did not use the word “intelligent”, even though “smart” and “intelligent” can be understood as equivalent.</p>