Move Linked Data definition to the beginning
authorMarkus Lanthaler <mark_lanthaler@gmx.net>
Wed, 16 May 2012 20:31:00 +0800
changeset 652 fc8fe654af6b
parent 651 1ab718fe7a3b
child 653 86de21c67d65
Move Linked Data definition to the beginning

As the whole document is about Linked Data, it should be properly defined at the beginning and not at the very end.
spec/latest/json-ld-syntax/index.html
--- a/spec/latest/json-ld-syntax/index.html	Wed May 16 20:21:45 2012 +0800
+++ b/spec/latest/json-ld-syntax/index.html	Wed May 16 20:31:00 2012 +0800
@@ -542,12 +542,32 @@
 <h2>Linking Data</h2>
 
 <p>
-An Internationalized Resource Identifier
-(<tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef>),
-as described in [[!RFC3987]], is a mechanism for representing unique
-identifiers on the Web. In <tref>Linked Data</tref>, an IRI is commonly
-used for expressing a <tref>subject</tref>, a <tref>property</tref> or an
-<tref>object</tref>.
+The following definition for <tref>Linked Data</tref> is the one that will
+be used for this specification.
+</p>
+<ol>
+  <li><tdef>Linked Data</tdef> is a set of documents, each containing a representation of a linked data graph.</li>
+  <li>A <tdef>linked data graph</tdef> is an unordered labeled directed graph, where nodes are <tref>subject</tref>s or <tref>object</tref>s, and edges are properties.</li>
+  <li>A <tdef>subject</tdef> is any node in a <tref>linked data graph</tref> with at least one outgoing edge.</li>
+  <li>A <tref>subject</tref> SHOULD be labeled with an <tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef> (an Internationalized Resource Identifier as described in [[!RFC3987]]).</li>
+  <li>An <tdef>object</tdef> is a node in a <tref>linked data graph</tref> with at least one incoming edge.</li>
+  <li>An <tref>object</tref> MAY be labeled with an <tref>IRI</tref>.</li>
+  <li>A node MAY be a <tref>subject</tref> and <tref>object</tref> at the same time.</li>
+  <li>A <tdef>property</tdef> is an edge of the <tref>linked data graph</tref>.</li>
+  <li>A <tref>property</tref> SHOULD be labeled with an <tref>IRI</tref>.</li>
+  <li>An <tref>IRI</tref> that is a label in a <tref>linked data graph</tref> SHOULD be dereferencable to a <tref>Linked Data</tref> document describing the labeled <tref>subject</tref>, <tref>object</tref> or <tref>property</tref>.</li>
+  <li>A <tdef>value</tdef> is an <tref>object</tref> with a label that is not an <tref>IRI</tref></li>
+</ol>
+
+<p class="issue">An illustration of a linked data graph would probably help here.</p>
+
+<p>
+Note that the definition for <tref>Linked Data</tref> above is silent on the
+topic of unlabeled nodes. Unlabeled nodes are not considered
+<tref>Linked Data</tref>. However, this specification allows for the expression
+of unlabled nodes, as most graph-based data sets on the Web contain a number
+of associated nodes that are not named and thus are not directly
+de-referenceable.
 </p>
 
 <p>JSON-LD defines a mechanism to map JSON terms, i.e., keys and values, to IRIs. This does not mean
@@ -2524,36 +2544,6 @@
 </section>
 </section>
 
-<section class="appendix">
-<h2>Linked Data</h2>
-<p>
-The following definition for <tref>Linked Data</tref> is the one that will
-be used for this specification.
-</p>
-<ol>
-  <li><tdef>Linked Data</tdef> is a set of documents, each containing a representation of a linked data graph.</li>
-  <li>A <tdef>linked data graph</tdef> is an unordered labeled directed graph, where nodes are <tref>subject</tref>s or <tref>object</tref>s, and edges are properties.</li>
-  <li>A <tdef>subject</tdef> is any node in a <tref>linked data graph</tref> with at least one outgoing edge.</li>
-  <li>A <tref>subject</tref> SHOULD be labeled with an <tref>IRI</tref> (an Internationalized Resource Identifier as described in [[!RFC3987]]).</li>
-  <li>An <tdef>object</tdef> is a node in a <tref>linked data graph</tref> with at least one incoming edge.</li>
-  <li>An <tref>object</tref> MAY be labeled with an <tref>IRI</tref>.</li>
-  <li>A node MAY be a <tref>subject</tref> and <tref>object</tref> at the same time.</li>
-  <li>A <tdef>property</tdef> is an edge of the <tref>linked data graph</tref>.</li>
-  <li>A <tref>property</tref> SHOULD be labeled with an <tref>IRI</tref>.</li>
-  <li>An <tref>IRI</tref> that is a label in a <tref>linked data graph</tref> SHOULD be dereferencable to a <tref>Linked Data</tref> document describing the labeled <tref>subject</tref>, <tref>object</tref> or <tref>property</tref>.</li>
-  <li>A <tdef>value</tdef> is an <tref>object</tref> with a label that is not an <tref>IRI</tref></li>
-</ol>
-
-<p>
-Note that the definition for <tref>Linked Data</tref> above is silent on the
-topic of unlabeled nodes. Unlabeled nodes are not considered
-<tref>Linked Data</tref>. However, this specification allows for the expression
-of unlabled nodes, as most graph-based data sets on the Web contain a number
-of associated nodes that are not named and thus are not directly
-de-referenceable.
-</p>
-</section>
-
 <section class="appendix informative">
 <h1>IANA Considerations</h1>