Harmonize General Terminology of API and Framing spec
authorMarkus Lanthaler <mark_lanthaler@gmx.net>
Thu, 30 Aug 2012 12:10:49 +0200
changeset 857 ea98c496af81
parent 856 579ae588f173
child 858 5df127a85d7a
Harmonize General Terminology of API and Framing spec

Removed linked data definition from Framing spec.
spec/latest/json-ld-api/index.html
spec/latest/json-ld-framing/index.html
--- a/spec/latest/json-ld-api/index.html	Thu Aug 30 11:15:36 2012 +0200
+++ b/spec/latest/json-ld-api/index.html	Thu Aug 30 12:10:49 2012 +0200
@@ -626,104 +626,90 @@
 <section>
   <h3>General Terminology</h3>
 
-  <p class="issue">
-The intent of the Working Group and the Editors of this specification is to
-eventually align terminology used in this document with the terminology used
-in the RDF Concepts document to the extent to which it makes sense to do so.
-In general, if there is an analogue to terminology used in this document in
-the RDF Concepts document, the preference is to use the terminology in the
-RDF Concepts document.
+  <p class="issue">The intent of the Working Group and the Editors of this
+    specification is to eventually align terminology used in this document
+    with the terminology used in the RDF Concepts document to the extent to
+    which it makes sense to do so. In general, if there is an analogue to
+    terminology used in this document in the RDF Concepts document, the
+    preference is to use the terminology in the RDF Concepts document.
   </p>
 
-  <p>
-The following is an explanation of the general terminology used in this
-document:
-  </p>
+  <p>The following is an explanation of the general terminology used in this
+    document:</p>
 
   <dl>
-      <dt><tdef>JSON object</tdef></dt><dd>
-      An object structure is represented as a pair of curly brackets surrounding zero or
+    <dt><tdef>JSON object</tdef></dt>
+    <dd>An object structure is represented as a pair of curly brackets surrounding zero or
       more name-value pairs. A name is a <tref>string</tref>. A single colon comes after
       each name, separating the name from the value. A single comma separates a value
-      from a following name. The names within an object SHOULD be unique.
-    </dd>
+      from a following name. The names within an object SHOULD be unique.</dd>
     <dt><tdef>array</tdef></dt>
-    <dd>
-      An array is represented as square brackets surrounding zero or more
-      values that are separated by commas.
-    </dd>
-    <dt><tdef>string</tdef></dt><dd>
-      A string is a sequence of zero or more Unicode (UTF-8) characters,
+    <dd>An array is represented as square brackets surrounding zero or more
+      values that are separated by commas.</dd>
+    <dt><tdef>string</tdef></dt>
+    <dd>A string is a sequence of zero or more Unicode (UTF-8) characters,
       wrapped in double quotes, using backslash escapes (if necessary). A
-      character is represented as a single character string.
-    </dd>
+      character is represented as a single character string.</dd>
     <dt><tdef>number</tdef></dt>
-    <dd>
-      A number is similar to that used in most programming languages, except
+    <dd>A number is similar to that used in most programming languages, except
       that the octal and hexadecimal formats are not used and that leading
       zeros are not allowed.</dd>
-    <dt><tdef>true</tdef> and <tdef>false</tdef></dt><dd>
-      Values that are used to express one of two possible boolean states.
-    </dd>
-    <dt><tdef>null</tdef></dt><dd>
-      Unless otherwise specified, a JSON-LD processor MUST act as if a
-      key-value pair in the body of a JSON-LD document was never declared when
-      the value equals <em>null</em>. If <code>@value</code>,
-      <code>@list</code>, or <code>@set</code> is set to <em>null</em> in
-      expanded form, then the entire JSON object is ignored. If
-      <code>@context</code> is set to <em>null</em>, the
-      <tref>active context</tref> is reset and when used
-      within a <tref>context</tref>, it removes any definition associated
-      with the key, unless otherwise specified.
-    </dd>
-    <dt><tdef>node definition</tdef></dt><dd>
-      A <tref>JSON object</tref> used to represent a <tref>node</tref> and
+    <dt><tdef>true</tdef> and <tdef>false</tdef></dt>
+    <dd>Values that are used to express one of two possible boolean states.</dd>
+    <dt><tdef>null</tdef></dt>
+    <dd>The use of the <tref>null</tref> value within JSON-LD is used to ignore or reset values.</dd>
+    <dt><tdef>keyword</tdef></dt>
+    <dd>A JSON key that is specific to JSON-LD, specified in the JSON-LD Syntax specification [[!JSON-LD]]
+      in the section titled <cite><a href="../json-ld-syntax/#syntax-tokens-and-keywords">Syntax Tokens and Keywords</a></cite>.</dd>
+    <dt><tdef>context</tdef></dt>
+    <dd>A a set of rules for interpreting a JSON-LD document as specified in
+      <cite><a href="../json-ld-syntax/#the-context">The Context</a></cite> of the [[JSON-LD]] specification.</dd>
+    <dt><tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef></dt>
+    <dd>An Internationalized Resource Identifier as described in [[!RFC3987]].</dd>
+    <dt><tdef>Linked Data</tdef></dt>
+    <dd>A set of documents, each containing a representation of a <tref>linked data graph</tref>.</dd>
+    <dt><tdef>linked data graph</tdef> or <tdef>dataset</tdef></dt>
+    <dd>An unordered labeled directed graph, where <tref title="node">nodes</tref> are
+      <tref title="IRI">IRIs</tref> or <tref title="Blank Node">Blank Nodes</tref>, or other values.
+      A <tref>linked data graph</tref> is a generalized representation of a
+      <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graph</a></cite>
+      as defined in [[!RDF-CONCEPTS]].</dd>
+    <dt><tdef>named graph</tdef></dt>
+    <dd>A <tref>linked data graph</tref> that is identified by an <tref>IRI</tref>.</dd>
+    <dt><tdef>graph name</tdef></dt>
+    <dd>The <tref>IRI</tref> identifying a <tref>named graph</tref>.</dd>
+    <dt><tdef>default graph</tdef></dt>
+    <dd>When executing an algorithm, the graph where data should be placed
+      if a <tref>named graph</tref> is not specified.</dd>
+    <dt><tdef>node</tdef></dt>
+    <dd>A piece of information that is represented in a <tref>linked data graph</tref>.</dd>
+    <dt><tdef>node definition</tdef></dt>
+    <dd>A <tref>JSON object</tref> used to represent a <tref>node</tref> and
       one or more properties of that node. A <tref>JSON object</tref> is a
       node definition if it does not contain they keys <code>@value</code>,
       <code>@list</code> or <code>@set</code> and it has one or more keys
       other than <code>@id</code>.</dd>
-    <dt><tdef>node reference</tdef></dt><dd>
-      A <tref>JSON object</tref> used to reference a node having only the
+    <dt><tdef>node reference</tdef></dt>
+    <dd>A <tref>JSON object</tref> used to reference a node having only the
       <code>@id</code> key.</dd>
-    <dt><tdef>Linked Data</tdef></dt>
-    <dd>A set of documents, each containing a representation of a <tref>linked data graph</tref>.</dd>
-    <dt><tdef>linked data graph</tdef> or <tdef>dataset</tdef></dt>
-    <dd>An unordered labeled directed graph, where <tref>node</tref>s are <tref title="IRI">IRIs</tref> or <tref title="Blank Node">Blank Nodes</tref>, or other values.
-      A linked data graph may be named using a <tref>graph name</tref>.
-      A <tref>linked data graph</tref> is a generalized representation of a
-      <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graph</a></cite>
-      as defined in [[!RDF-CONCEPTS]].</dd>
-    <dt><tdef>node</tdef></dt>
-    <dd>A piece of information that is represented in a <tref>linked data graph</tref>.</dd>
-    <dt><tdef>named graph</tdef></dt>
-    <dd>A <tref>linked data graph</tref> that has one or more
-      <tref>IRI</tref> that are used to refer to it.</dd>
-    <dt><tdef>graph name</tdef></dt>
-    <dd>An <tref>IRI</tref> that is a reference to a <tref>named graph</tref>.</dd>
-    <dt><tdef>default graph</tdef></dt>
-    <dd>When executing an algorithm, the graph where data should be placed
-      if a <tref>named graph</tref> is not specified.</dd>
+    <dt><tdef>blank node</tdef></dt>
+    <dd>A <tref>node</tref> in the <tref>linked data graph</tref> that does not contain a de-referenceable
+      identifier because it is either ephemeral in nature or does not contain information that needs to be
+      linked to from outside of the linked data graph. A blank node is assigned an identifier starting with
+      the prefix <code>_:</code>.</dd>
+    <dt><tdef>property</tdef></dt>
+    <dd>The <tref>IRI</tref> label of an edge in a <tref>linked data graph</tref>.</dd>
     <dt><tdef>subject</tdef></dt>
     <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one outgoing edge, related to an <tref>object</tref> node through a <tref>property</tref>.</dd>
-    <dt><tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef></dt>
-    <dd>An Internationalized Resource Identifier as described in [[!RFC3987]].</dd>
     <dt><tdef>object</tdef></dt>
     <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one incoming edge.</dd>
-    <dt><tdef>property</tdef></dt>
-    <dd>The <tref>IRI</tref> label of an edge in a <tref>linked data graph</tref>.</dd>
-    <dt><tdef>literal</tdef></dt>
-    <dd>An <tref>object</tref> expressed as a value such as a string, number or <tref>expanded value</tref>.</dd>
     <dt><tdef>quad</tdef></dt>
-    <dd>A piece of information that contains four items; a
-      <tref>subject</tref>, a <tref>property</tref>, a <tref>object</tref>,
-      and a <tref>graph name</tref>. <span class="issue">normalize use of <em>property</em> and <em>predicate</em>.</span></dd>
-    <dt><tdef>context</tdef></dt>
-    <dd>A <tref>JSON object</tref> that contains rules for interpreting a JSON-LD document.</dd>
-    <dt><tdef>keyword</tdef></dt>
-    <dd>A JSON key that is specific to JSON-LD, specified in the JSON-LD
-      Syntax specification [[!JSON-LD]] in the section titled
-      <a href="../json-ld-syntax/#syntax-tokens-and-keywords">Syntax Tokens and Keywords</a>.</dd>
-   </dl>
+    <dd>A piece of information that contains four items; a <tref>subject</tref>, a <tref>property</tref>,
+      an <tref>object</tref>, and a <tref>graph name</tref>.
+      <p class="issue">normalize use of <em>property</em> and <em>predicate</em>.</p></dd></dd>
+    <dt><tdef>literal</tdef></dt>
+    <dd>An <tref>object</tref> expressed as a value such as a string, number or in expanded form.</dd>
+  </dl>
  </section>
 
   <section>
@@ -1050,7 +1036,7 @@
     </section>
 
     <section>
-    <h3><tdef>Blank Node</tdef></h3>
+    <h3>Blank Node</h3>
 
     <p>A <tref>node</tref> in the <tref>linked data graph</tref> that
     does not contain a de-reference-able identifier because it is either
--- a/spec/latest/json-ld-framing/index.html	Thu Aug 30 11:15:36 2012 +0200
+++ b/spec/latest/json-ld-framing/index.html	Thu Aug 30 12:10:49 2012 +0200
@@ -308,118 +308,91 @@
 <section>
   <h3>General Terminology</h3>
 
+  <p class="issue">The intent of the Working Group and the Editors of this
+    specification is to eventually align terminology used in this document
+    with the terminology used in the RDF Concepts document to the extent to
+    which it makes sense to do so. In general, if there is an analogue to
+    terminology used in this document in the RDF Concepts document, the
+    preference is to use the terminology in the RDF Concepts document.
+  </p>
+
   <p>The following is an explanation of the general terminology used in this document:</p>
   <dl>
-    <dt><tdef>JSON object</tdef></dt><dd>
-      An object structure is represented as a pair of curly brackets surrounding zero or
-      more name/value pairs. A name is a <tref>string</tref>. A single colon comes after
+    <dt><tdef>JSON object</tdef></dt>
+    <dd>An object structure is represented as a pair of curly brackets surrounding zero or
+      more name-value pairs. A name is a <tref>string</tref>. A single colon comes after
       each name, separating the name from the value. A single comma separates a value
-      from a following name. The names within an object SHOULD be unique.
-    </dd>
+      from a following name. The names within an object SHOULD be unique.</dd>
     <dt><tdef>array</tdef></dt>
-    <dd>
-      An array is an ordered collection of values. An array structure is represented as square brackets surrounding zero or more values (or elements). Elements are separated by commas.  Within JSON-LD, array order is not preserved by default, unless
-      specific markup is provided. This is because the basic data model of JSON-LD is a <tref>linked data graph</tref>, which is inherently unordered.
-    </dd>
-    <dt><tdef>string</tdef></dt><dd>
-      A string is a sequence of zero or more Unicode characters, wrapped in double quotes, using backslash escapes. A
-      character is represented as a single character string.
-    </dd>
+    <dd>An array is represented as square brackets surrounding zero or more
+      values that are separated by commas.</dd>
+    <dt><tdef>string</tdef></dt>
+    <dd>A string is a sequence of zero or more Unicode (UTF-8) characters,
+      wrapped in double quotes, using backslash escapes (if necessary). A
+      character is represented as a single character string.</dd>
     <dt><tdef>number</tdef></dt>
-    <dd>
-      A number is similar to that used in most programming languages, except that the octal and hexadecimal formats are not used and that leading zeros are not allowed.</dd>
-    <dt><tdef>true</tdef> and <tdef>false</tdef></dt><dd>
-      Boolean values.
-    </dd>
-    <dt><tdef>null</tdef></dt><dd>
-      The use of the <tref>null</tref> value within JSON-LD is used to ignore or reset values.
-    </dd>
+    <dd>A number is similar to that used in most programming languages, except
+      that the octal and hexadecimal formats are not used and that leading
+      zeros are not allowed.</dd>
+    <dt><tdef>true</tdef> and <tdef>false</tdef></dt>
+    <dd>Values that are used to express one of two possible boolean states.</dd>
+    <dt><tdef>null</tdef></dt>
+    <dd>The use of the <tref>null</tref> value within JSON-LD is used to ignore or reset values.</dd>
     <dt><tdef>keyword</tdef></dt>
-    <dd>
-      A JSON key that is specific to JSON-LD, specified in the JSON-LD Syntax specification [[!JSON-LD]]
-      in the section titled <a href="../json-ld-syntax/#syntax-tokens-and-keywords">Syntax Tokens and Keywords</a>.
-    </dd>
+    <dd>A JSON key that is specific to JSON-LD, specified in the JSON-LD Syntax specification [[!JSON-LD]]
+      in the section titled <cite><a href="../json-ld-syntax/#syntax-tokens-and-keywords">Syntax Tokens and Keywords</a></cite>.</dd>
+    <dt><tdef>context</tdef></dt>
+    <dd>A a set of rules for interpreting a JSON-LD document as specified in
+      <cite><a href="../json-ld-syntax/#the-context">The Context</a></cite> of the [[JSON-LD]] specification.</dd>
+    <dt><tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef></dt>
+    <dd>An Internationalized Resource Identifier as described in [[!RFC3987]].</dd>
+    <dt><tdef>Linked Data</tdef></dt>
+    <dd>A set of documents, each containing a representation of a <tref>linked data graph</tref>.</dd>
+    <dt><tdef>linked data graph</tdef> or <tdef>dataset</tdef></dt>
+    <dd>An unordered labeled directed graph, where <tref title="node">nodes</tref> are
+      <tref title="IRI">IRIs</tref> or <tref title="Blank Node">Blank Nodes</tref>, or other values.
+      A <tref>linked data graph</tref> is a generalized representation of a
+      <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graph</a></cite>
+      as defined in [[!RDF-CONCEPTS]].</dd>
+    <dt><tdef>named graph</tdef></dt>
+    <dd>A <tref>linked data graph</tref> that is identified by an <tref>IRI</tref>.</dd>
+    <dt><tdef>graph name</tdef></dt>
+    <dd>The <tref>IRI</tref> identifying a <tref>named graph</tref>.</dd>
+    <dt><tdef>default graph</tdef></dt>
+    <dd>When executing an algorithm, the graph where data should be placed
+      if a <tref>named graph</tref> is not specified.</dd>
+    <dt><tdef>node</tdef></dt>
+    <dd>A piece of information that is represented in a <tref>linked data graph</tref>.</dd>
     <dt><tdef>node definition</tdef></dt>
-    <dd>
-      A <tref>JSON object</tref> used to represent a <tref>node</tref> and one or more properties of that node.
-      A <tref>JSON object</tref> is a node definition if it does not contain the keys <code>@value</code>,
-      <code>@list</code> or <code>@set</code> and it has one or more keys other than <code>@id</code>.
-    </dd>
+    <dd>A <tref>JSON object</tref> used to represent a <tref>node</tref> and
+      one or more properties of that node. A <tref>JSON object</tref> is a
+      node definition if it does not contain they keys <code>@value</code>,
+      <code>@list</code> or <code>@set</code> and it has one or more keys
+      other than <code>@id</code>.</dd>
     <dt><tdef>node reference</tdef></dt>
-    <dd>
-      A <tref>JSON object</tref> used to reference a node having only the <code>@id</code> key.
-    </dd>
+    <dd>A <tref>JSON object</tref> used to reference a node having only the
+      <code>@id</code> key.</dd>
+    <dt><tdef>blank node</tdef></dt>
+    <dd>A <tref>node</tref> in the <tref>linked data graph</tref> that does not contain a de-referenceable
+      identifier because it is either ephemeral in nature or does not contain information that needs to be
+      linked to from outside of the linked data graph. A blank node is assigned an identifier starting with
+      the prefix <code>_:</code>.</dd>
+    <dt><tdef>property</tdef></dt>
+    <dd>The <tref>IRI</tref> label of an edge in a <tref>linked data graph</tref>.</dd>
+    <dt><tdef>subject</tdef></dt>
+    <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one outgoing edge, related to an <tref>object</tref> node through a <tref>property</tref>.</dd>
+    <dt><tdef>object</tdef></dt>
+    <dd>A <tref>node</tref> in a <tref>linked data graph</tref> with at least one incoming edge.</dd>
+    <dt><tdef>quad</tdef></dt>
+    <dd>A piece of information that contains four items; a <tref>subject</tref>, a <tref>property</tref>,
+      an <tref>object</tref>, and a <tref>graph name</tref>.</dd>
+    <dt><tdef>literal</tdef></dt>
+    <dd>An <tref>object</tref> expressed as a value such as a string, number or in expanded form.</dd>
   </dl>
 </p>
 </section>
 
 <section>
-<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 <tref>linked data graph</tref>.</li>
-  <li>A <tdef>linked data graph</tdef> is an unordered labeled directed graph, where <tdef>node</tdef>s are <tref title="IRI">IRIs</tref> or <tref title="Blank Node">Blank Nodes</tref>, or other values.
-    A linked data graph may be named using a <tdef>graph name</tdef>.
-    A <tref>linked data graph</tref> is a generalized representation of a
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-graph">RDF graph</a></cite>
-    as defined in [[!RDF-CONCEPTS]].</li>
-  <li>A <tref>node</tref> having an outgoing edge MUST be an <tref>IRI</tref> or <tref>Blank Node</tref>.</li>
-  <li>A <tref>node</tref> having an incoming edge MUST be an <tref>IRI</tref>, <tref>Blank Node</tref>, or value such as a number or string.</li>
-  <li>A <tref>node</tref> MAY have both incoming and outgoing edges.</li>
-  <li>An edge MUST be labeled with an absolute IRI, within the JSON-LD syntax, this label is called a <tdef>property</tdef>.</li>
-  <li>Two nodes related by an edge form a <tdef>statement</tdef> where the nodes are referred to <tdef>subject</tdef> and <tdef>object</tdef> and the edge referred to as the <tdef>predicate</tdef>*.</li>
-  <li><tref title="IRI">IRIs</tref> used within a <tref>linked data graph</tref> SHOULD be dereferenceable to a <tref>Linked Data</tref> document describing the resource denoted by that <tref>IRI</tref>.</li>
-  <li>An <tdef><abbr title="Internationalized Resource Identifier">IRI</abbr></tdef> (an Internationalized Resource Identifier) is described in [[!RFC3987]])
-    and the use with JSON-LD conforms to the definition of
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-iri">IRI</a></cite> in [[!RDF-CONCEPTS]].</li>
-  <li>A <tdef>dataset</tdef> represents a collection of
-    <tref title="linked data graph">linked data graphs</tref>. It is comprized of
-    a <tdef>default graph</tdef>, which does not have a name,
-    and zero or more <tdef title="named graph">named graphs</tdef> each named using
-    a <tref>node</tref> See
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#section-multigraph">Abstract Syntax for Working with Multiple Graphs</a></cite>
-    in [[!RDF-CONCEPTS]].</li>
-  <li>A <tdef>blank node</tdef> is a <tref>node</tref> which is neither an <tref>IRI</tref> nor a <tref>literal</tref>
-    but represents an unknown <tref>node</tref>, which may be either an <tref>IRI</tref> or a <tref>literal</tref>.
-    Within a document, a <tref>blank node</tref> may have an identifier used for intra-document reference
-    purposes only. See [[!RDF-CONCEPTS]] for a further description of
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-blank-node">blank nodes</a></cite>.</li>
-  <li>A <tdef>literal</tdef> is used to identify values such as numbers and dates.
-    A <tref>literal</tref> may be an <tref>object</tref> in a <tref>linked data graph</tref>.
-    See [[!RDF-CONCEPTS]] for a further definition of
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-literal">literal</a></cite>.</li>
-  <li>A <tdef>Quad</tdef> contains a <tref>subject</tref>, <tref>predicate</tref>, <tref>object</tref>,
-    and optionally a <tref>graph name</tref>.
-    See [[!RDF-CONCEPTS]] definition for
-    <cite><a href="http://www.w3.org/TR/rdf11-concepts/#dfn-rdf-triple">RDF triple</a></cite>,
-    which most closely aligns to <a>Quad</a>.</li>
-</ol>
-
-<div class="issue" data-number="47">
-  <p>Richard Cyganiak suggests that the data model is at odds with [[RDF-CONCEPTS]] and should
-    be more closely aligned with it instead of creating new terminology.</p>
-  <p>Note that this definition is provisional, and may be reverted to something closer to the original depending on community feedback.</p>
-  <ol>
-    <li><tref>Linked Data</tref> is a set of documents, each containing a representation of a <tref>linked data graph</tref>.</li>
-    <li>A <tref>linked data graph</tref> is an unordered labeled directed graph, where nodes are <tref>subject</tref>s or <tref>object</tref>s, and edges are labeled using <tref title="property">properties</tref>.</li>
-    <li>A <tref>subject</tref> 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><abbr title="Internationalized Resource Identifier">IRI</abbr></tref> (an Internationalized Resource Identifier as described in [[!RFC3987]]).</li>
-    <li>An <tref>object</tref> 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> or a label that is not an <tref>IRI</tref> such as plain text, internationalized text, or a strictly-typed data value.</li>
-    <li>A node MAY be a <tref>subject</tref> and an <tref>object</tref> at the same time.</li>
-    <li>A <tref>property</tref> is the label on an edge in a
-      <tref>linked data graph</tref>.</li>
-    <li>A <tref>property</tref> SHOULD be 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>property</tref> or <tref>object</tref>.</li>
-  </ol>
-</div>
-
-</section>
-
-<section>
   <h2>Contributing</h2>
 
   <p>There are a number of ways that one may participate in the development of