author Richard Cyganiak Tue, 06 Nov 2012 21:23:01 +0000 changeset 531 e72877b6b6a1 parent 530 08a9867b4581 child 532 eef9efce51fc
various editorial changes (ISSUE-91)
 rdf-concepts/index.html
```--- a/rdf-concepts/index.html	Tue Nov 06 20:07:00 2012 +0000
+++ b/rdf-concepts/index.html	Tue Nov 06 21:23:01 2012 +0000
@@ -365,29 +365,6 @@
<p>An <dfn>RDF graph</dfn> is a set of
<a title="RDF triple">RDF triples</a>.</p>

-    <p><a name="section-graph-equality"></a><dfn>Graph isomorphism</dfn>:
-    Two <a title="RDF graph">RDF graphs</a>
-    <var>G</var> and <var>G'</var> are <em>isomorphic</em> if there
-    is a bijection <var>M</var> between the sets of nodes of the two graphs,
-    such that:</p>
-
-    <ol>
-      <li><var>M</var> maps blank nodes to blank nodes.</li>
-      <li><var>M(lit)=lit</var> for all <a title="literal">RDF literals</a> <var>lit</var> which
-      are nodes of <var>G</var>.</li>
-
-      <li><var>M(uri)=uri</var> for all <a title="IRI">IRIs</a> <var>uri</var>
-      which are nodes of <var>G</var>.</li>
-
-      <li>The triple <var>( s, p, o )</var> is in <var>G</var> if and
-      only if the triple <var>( M(s), p, M(o) )</var> is in
-      <var>G'</var></li>
-    </ol>
-    <p>With this definition, <var>M</var> shows how each blank node
-    in <var>G</var> can be replaced with
-    a new blank node to give <var>G'</var>. Graph isomorphism
-    is needed to support the RDF Test Cases [[RDF-TESTCASES]] specification.</p>
-

<section id="section-triples">
<h3>Triples</h3>
@@ -409,7 +386,8 @@

<p>The set of <dfn title="node">nodes</dfn> of an <a>RDF graph</a>
is the set of subjects and objects of triples in the graph.
-    Predicate IRIs MAY also appear as nodes in the graph.</p>
+    It is possible for a predicate IRI to also occur as a node in
+    the same graph.</p>

<p><a title="IRI">IRIs</a>, <a title="blank node">blank nodes</a> and
<a title="literal">literals</a> are collectively known as
@@ -497,6 +475,11 @@
Form C [[!NFC]]</li>
</ul>
</div>
+
+    <p class="issue">In some sections, the content is overwhelmed by
+    informative Notes. Are they all necessary? Can they be moved to other
+    documents? Can they be merged or streamlined? This is
+    <a href="https://www.w3.org/2011/rdf-wg/track/issues/104">ISSUE-104</a>.</p>
</section>

@@ -512,8 +495,8 @@
<ul>
<li>a <dfn>lexical form</dfn> being a Unicode [[!UNICODE]] string,
which SHOULD be in Normal Form C [[!NFC]],</li>
-    <li>a <dfn>datatype IRI</dfn> being an <a>IRI</a> that establishes
-    the <a>literal value</a>.</li>
+    <li>a <dfn>datatype IRI</dfn> being an <a>IRI</a> that determines
+    how the lexical form maps to a <a>literal value</a>.</li>
</ul>

<p>A literal is a <dfn>language-tagged string</dfn> if and only if its
@@ -658,6 +641,34 @@
IRI that results in a well-known URI after IRI-to-URI mapping [[!RFC3987]].</p>
</section>

+
+<section id="graph-isomorphism">
+    <h3>Graph Isomorphism</h3>
+
+    <p><a name="section-graph-equality"></a>Two
+    <a title="RDF graph">RDF graphs</a> <var>G</var> and <var>G'</var> are
+    <dfn title="graph isomorphism">isomorphic</dfn> if there
+    is a bijection <var>M</var> between the sets of nodes of the two graphs,
+    such that:</p>
+
+    <ol>
+      <li><var>M</var> maps blank nodes to blank nodes.</li>
+      <li><var>M(lit)=lit</var> for all <a title="literal">RDF literals</a> <var>lit</var> which
+      are nodes of <var>G</var>.</li>
+
+      <li><var>M(uri)=uri</var> for all <a title="IRI">IRIs</a> <var>uri</var>
+      which are nodes of <var>G</var>.</li>
+
+      <li>The triple <var>( s, p, o )</var> is in <var>G</var> if and
+      only if the triple <var>( M(s), p, M(o) )</var> is in
+      <var>G'</var></li>
+    </ol>
+    <p>With this definition, <var>M</var> shows how each blank node
+    in <var>G</var> can be replaced with
+    a new blank node to give <var>G'</var>. Graph isomorphism
+    is needed to support the RDF Test Cases [[RDF-TESTCASES]] specification.</p>
+</section>
+
</section>

@@ -745,24 +756,14 @@
is denoted by one or more <a title="IRI">IRIs</a>.</p>

<p>The <dfn>lexical space</dfn> of a datatype is a set of Unicode [[!UNICODE]] strings.</p>
-<p>
-The <dfn>lexical-to-value mapping</dfn> of a datatype is a set of pairs whose
-first element belongs to
-the <a>lexical space</a> of the datatype,
-and the second element belongs to the
- <dfn>value space</dfn> of the datatype:
-</p>
-<ul>
-<li>
-Each member of the lexical space is paired with (maps to) exactly one member
-of the value space.
-</li>
-<li>
-Each member of the value space may be paired with any number (including
-zero) of members of the lexical space (lexical representations for that
-value).
-</li>
-</ul>
+
+    <p>The <dfn>lexical-to-value mapping</dfn> of a datatype is a set of
+    pairs whose first element belongs to the <a>lexical space</a>,
+    and the second element belongs to the <dfn>value space</dfn>
+    of the datatype. Each member of the lexical space is paired with exactly
+    one value, and is a <em>lexical representation</em>
+    of that value. The mapping can be seen as a function
+    from the lexical space to the value space.</p>

<div class="note">
<p>When the datatype is defined using XML Schema:```