--- a/rdf-dataset/index.html Sun Dec 15 22:53:18 2013 +0100
+++ b/rdf-dataset/index.html Sun Dec 15 22:59:35 2013 +0100
@@ -165,7 +165,7 @@
<li>it denotes the information resource that can be obtained by dereferencing the graph name, when it is an IRI and if such resource exists;</li>
<li>it denotes an arbitrary resource that is constrained to be in a special relationship (for instance, <code>ex:hasGraph</code> with the graph inside the pair;</li>
<li>it denotes the deductive closure of the graph inside the pair;</li>
- <li>it denotes an arbitrary resource that is in a special relation with the deductive closure, or with a superset of the graph;</code>
+ <li>it denotes an arbitrary resource that is in a special relation with the deductive closure, or with a superset of the graph;</li>
<li>it denotes an unconstrained resource;</li>
<li>etc.</li>
</ul>
@@ -404,12 +404,12 @@
<p>Let <var>d</var> be the function that maps an IRI to an RDF graph that can be obtained from dereferencing the IRI. For an IRI <var>u</var>, <var>d(u)</var> is empty when dereferencing returns an error or a document that does not encode an RDF graph.</p>
<p>A dataset-interpretation <var>I</var> with respect to an entailment regime <var>E</var> is an <var>E</var>-interpretation such that:</p>
<ul>
- <li>for a named graph pair <var>ng</var> = <var>(n,G)</var>, <var>I(ng)</a> is true if <var>d(n)</var> equals (respectively, is a subgraph of, is entailed by) <var>G</var>;</li>
+ <li>for a named graph pair <var>ng</var> = <var>(n,G)</var>, <var>I(ng)</var> is true if <var>d(n)</var> equals (respectively, is a subgraph of, is entailed by) <var>G</var>;</li>
<li>for a dataset <var>D</var> = <var>(DG,NG)</var>, <var>I(D)</var> is true if <var>I(DG)</var> is true and for all named graph <var>ng</var> in <var>NG</var>, <var>I(ng)</var> is true;
<li><var>I(D)</var> is false otherwise.</li>
</ul>
- <h4 id="ex4" class="ex">Examples</h4>
+ <h4 id="exbox" class="ex">Examples</h4>
<p>Entailments in this semantics depend not only on the content of a dataset but also on the content of the Web and the ability of a reasoner to accept this content. Moreover, the entailments vary whether the considered relation is “equals”, or “subgraph of”, or “entailed by”.</p>
<p>For instance, if the reasoner is offline, then the dereferencing function <var>d</var> in the previous definition always return an empty graph. In this case, if the relation is “equals” or “subgraph of”, only empty named graphs can be true; if the relation is “entails by”, then only named graphs containing axiomatic triples are true. In general, if the relationship is “equals”, named graph do not provide extra entailments.</p>