--- a/rdf-concepts/index.html Thu Nov 10 22:06:23 2011 +0000
+++ b/rdf-concepts/index.html Thu Nov 10 23:48:55 2011 +0000
@@ -670,42 +670,12 @@
</p>
-<section id="section-triples">
- <h3>RDF Triples</h3>
-
- <p>An <dfn>RDF triple</dfn> contains three components:</p>
-
- <ul>
- <li>the <dfn>subject</dfn>, which is an
- <a>IRI</a> or a <a>blank node</a></li>
-
- <li>the <dfn>predicate</dfn>, which is an <a>IRI</a></li>
-
- <li>the <dfn>object</dfn>, which is an <a>IRI</a>,
- a <a>literal</a> or a <a>blank node</a></li>
- </ul>
-
- <p>An RDF triple is conventionally written in the order subject,
- predicate, object.</p>
-
- <p>The predicate is also known as the <dfn>property</dfn> of the triple.</p>
-
- <p><a title="IRI">IRIs</a>, <a title="blank node">blank nodes</a> and
- <a title="literal">literals</a> are collectively known as
- <dfn title="RDF term">RDF terms</dfn>.</p>
-</section>
-
-
<section id="section-rdf-graph">
<h3>RDF Graphs</h3>
<p>An <dfn>RDF graph</dfn> is a set of
<a title="RDF triple">RDF triples</a>.</p>
- <p>The set of <dfn title="node">nodes</dfn> of an RDF graph is the set of subjects and objects of
- triples in the graph.</p>
-</section>
-
<p><a name="section-graph-equality"></a><dfn>Graph equivalence</dfn>:
Two <a title="RDF graph">RDF graphs</a>
<var>G</var> and <var>G'</var> are equivalent if there
@@ -728,6 +698,36 @@
in <var>G</var> can be replaced with
a new blank node to give <var>G'</var>. A definition of graph equivalence
is needed to support the RDF Test Cases [[RDF-TESTCASES]] specification.</p>
+</section>
+
+
+<section id="section-triples">
+ <h3>RDF Triples</h3>
+
+ <p>An <dfn>RDF triple</dfn> contains three components:</p>
+
+ <ul>
+ <li>the <dfn>subject</dfn>, which is an
+ <a>IRI</a> or a <a>blank node</a></li>
+
+ <li>the <dfn>predicate</dfn>, which is an <a>IRI</a></li>
+
+ <li>the <dfn>object</dfn>, which is an <a>IRI</a>,
+ a <a>literal</a> or a <a>blank node</a></li>
+ </ul>
+
+ <p>An RDF triple is conventionally written in the order subject,
+ predicate, object.</p>
+
+ <p>The predicate is also known as the <dfn>property</dfn> of the triple.</p>
+
+ <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.</p>
+
+ <p><a title="IRI">IRIs</a>, <a title="blank node">blank nodes</a> and
+ <a title="literal">literals</a> are collectively known as
+ <dfn title="RDF term">RDF terms</dfn>.</p>
+</section>
<section id="section-IRIs">
@@ -1000,6 +1000,25 @@
<section id="section-multigraph">
<h2>Abstract Syntax for Working with Multiple Graphs</h2>
+ <p>The RDF data model expresses information as
+ <a title="RDF graph">RDF graphs</a> consisting of
+ <a title="triple">triples</a> with subject, predicate and object.
+ Often, one wants to hold multiple RDF graphs and record information
+ about each graph, allowing an application to work with datasets
+ that involve information from more than one graph.</p>
+
+ <p>An <dfn>RDF Dataset</dfn> is a collection of
+ <a title="RDF graph">RDF graphs</a> and comprises:</p>
+
+ <ul>
+ <li>Exactly one <dfn>default graph</dfn>, being an <a>RDF graph</a>.
+ The default graph does not have a name.</li>
+ <li>Zero or more <dfn title="named graph">named graphs</dfn>.
+ Each named graph is a pair consisting of an <a>IRI</a>
+ (the <dfn>graph name</dfn>), and an <a>RDF graph</a>.
+ Graph names are unique within an RDF dataset.</li>
+ </ul>
+
<div class="issue">
<p>The Working Group will standardize a model and semantics for
multiple graphs and graphs stores. The
@@ -1032,25 +1051,6 @@
<p>The design presented here should be considered a straw man proposal at this point. It is based on RDF Datasets as <a href="http://www.w3.org/TR/sparql11-query/#rdfDataset">defined in SPARQL 1.1</a>.</p>
</div>
- <p>The RDF data model expresses information as
- <a title="RDF graph">RDF graphs</a> consisting of
- <a title="triple">triples</a> with subject, predicate and object.
- Often, one wants to hold multiple RDF graphs and record information
- about each graph, allowing an application to work with datasets
- that involve information from more than one graph.</p>
-
- <p>An <dfn>RDF Dataset</dfn> is a collection of
- <a title="RDF graph">RDF graphs</a> and comprises:</p>
-
- <ul>
- <li>Exactly one <dfn>default graph</dfn>, being an <a>RDF graph</a>.
- The default graph does not have a name.</li>
- <li>Zero or more <dfn title="named graph">named graphs</dfn>.
- Each named graph is a pair consisting of an <a>IRI</a>
- (the <dfn>graph name</dfn>), and an <a>RDF graph</a>.
- Graph names are unique within an RDF dataset.</li>
- </ul>
-
</section>
</section>