--- a/rdf-mt/index.html Wed Jul 03 11:05:44 2013 -0400
+++ b/rdf-mt/index.html Wed Jul 03 08:40:06 2013 -0700
@@ -239,7 +239,7 @@
<p >is lean. <a>Ground</a> graphs are lean. </p>
-<section> <h3>Shared blank nodes, unions and merges</h3>
+<section> <h3 id="unions_merges">Shared blank nodes, unions and merges</h3>
<p>
Graphs share blank nodes only if they are derived from graphs
described by documents or other structures (such as an RDF dataset) that explicitly provide for the sharing of blank nodes between different RDF graphs. Simply downloading a
@@ -395,7 +395,7 @@
a denotation by an interpretation, reflecting the intuition that
they have no 'global' meaning. </p>
-<section class="informative"><h3>Shared blank nodes (Informative)</h3>
+<section class="informative"><h3 id="shared_blank_nodes">Shared blank nodes (Informative)</h3>
<p> The semantics for blank nodes are stated in terms of the truth of a graph. However, when two (or more) graphs share a blank node, their meaning is not fully captured by treating them in isolation. For example, consider the overlapping graphs</p>
<p><img src="RDF11SemanticsDiagrams/example5.jpg"></p>
@@ -436,7 +436,7 @@
<section class="informative">
-<h3>Properties of simple entailment (Informative) </h3>
+<h3 id="simple_entailment_properties">Properties of simple entailment (Informative) </h3>
<p>The properties described here apply only to simple entailment, not to extended notions of entailment introduced in later sections. Proofs are given in Appendix C. </p>
<p class="fact">Every graph is satisfiable.</p>
@@ -561,7 +561,7 @@
-<section class="informative"> <h4>Patterns of datatype entailment (Informative)</h4>
+<section class="informative"> <h4 id="datatype_entailment_patterns">Patterns of datatype entailment (Informative)</h4>
<p>Unlike <a title="simply entails">simple entailment</a>, it is not possible to give a single syntactic criterion to detect all D-entailments, which
can hold because of particular properties of the lexical-to-value mappings of the <a>recognize</a>d datatypes. For example, if D contains <code>xsd:decimal</code> then </p>
@@ -641,7 +641,7 @@
<p>The properties of <a>simple entailment</a> described earlier do not all apply to <a>RDF entail</a>ment. For example, all the RDF axioms are true in every <a>RDF interpretation</a>, and so are <a>RDF entail</a>ed by the empty graph, contradicting <a>interpolation</a> for RDF entailment. </p>
-<section class="informative"><h4>Patterns of RDF entailment (Informative)</h4>
+<section class="informative"><h4 id="rdf_entailment_patterns">Patterns of RDF entailment (Informative)</h4>
<p> The last semantic condition in the above table gives the following entailment pattern for <a>recognize</a>d datatype IRIs: </p>
<div class="tabletitle">RDF entailment pattern.</div>
@@ -716,7 +716,7 @@
</section>
</section>
</section>
-<section><h2>RDFS Interpretations</h2>
+<section><h2 id="rdfs_interpretations">RDFS Interpretations</h2>
<p>RDF Schema [[RDF-SCHEMA]]
extends RDF to a larger vocabulary
with more complex semantic constraints:</p>
@@ -938,7 +938,7 @@
<p>RDFS does not partition the universe into disjoint categories of classes, properties and individuals. Anything in the universe can be used as a class or as a property, or both, while retaining its status as an individual which may be in classes and have properties. Thus, RDFS permits classes which contain other classes, classes of properties, properties of classes, etc. As the axiomatic triples above illustrate, it also permits classes which contain themselves and properties which apply to themselves. A property of a class is not necessarily a property of its members, nor vice versa. </p>
<section class="informative">
-<h4>A note on rdfs:Literal (Informative)</h3>
+<h4 id="rdfs_literal_note">A note on rdfs:Literal (Informative)</h3>
<p>The class <code>rdfs:Literal</code> is not the class of literals, but rather that of literal values, which may also be referred to by IRIs. For example, LV does not contain the literal <code>"foodle"^^xsd:string</code> but it does contain the string "foodle".</p>
<p>A triple of the form</p>
@@ -1062,7 +1062,7 @@
</section>
</section>
</section>
-<section><h2>RDF Datasets</h2>
+<section><h2 id="rdf_datasets">RDF Datasets</h2>
<p>An RDF <a href="http://www.w3.org/TR/rdf11-concepts/#section-dataset" class="externalDFN">dataset</a> (see [[!RDF11-CONCEPTS]]) is a finite set of RDF graphs each paired with an IRI or blank node called the <strong>graph name</strong>, plus a <strong>default graph</strong>, without a name. Graphs in a single dataset may share blank nodes. The association of graph name IRIs with graphs is used by SPARQL [[RDF-SPARQL-QUERY]] to allow queries to be directed against particular graphs.</p>
@@ -1077,7 +1077,7 @@
</section>
-<h2>Appendices</h2>
+<h2 id="appendices">Appendices</h2>
<section class="appendix" class="informative"><h2 id="entailment_rules">Entailment rules (Informative)</h2>
@@ -1524,7 +1524,7 @@
</p>
- <p>This document was prepared using the <a href="http://dev.w3.org/2009/dap/ReSpec.js/documentation.html#dfn-respec">ReSpec.js specification writing tool</a> developed by Robin Berjon. </p>
+ <p>This document was prepared using the <a href="http://dev.w3.org/2009/dap/ReSpec.js/documentation.html">ReSpec.js specification writing tool</a> developed by Robin Berjon. </p>
</section>
</body>