--- a/ldpatch.html Sat Jul 26 17:16:36 2014 -0400
+++ b/ldpatch.html Sun Jul 27 10:21:12 2014 -0400
@@ -3,7 +3,7 @@
<head>
<title>Linked Data Patch Format</title>
<meta charset='utf-8'>
- <script src='https://www.w3.org/Tools/respec/respec-w3c-common'
+ <script src='//www.w3.org/Tools/respec/respec-w3c-common'
async class='remove'></script>
<script class='remove'>
var preProc = {
@@ -188,6 +188,29 @@
<p>
An instance of the LD Patch language (or LD Patch document) defines a list of operations to be performed against an RDF Graph, namely the addition or removal of RDF triples in this graph.
</p>
+
+ <p id="relation-sparql-update">
+The LD Patch format described in this document should be seen as an assembly language for updating RDF Graphs. It is the intention to confine its expressive power to an RDF diff with minimal support for Blank Nodes. For more powerful operations on RDF Graphs and Quad Stores, the LDP WG recommends the reader to consider <a href="http://www.w3.org/TR/sparql11-update/">SPARQL Update</a>.
+ </p>
+
+ <!--p>
+In fact, LD Patch _could_ have been defined as a subset of SPARQL
+Update, even though the group had decided not to depend on SPARQL as a
+whole. This option was considered and we decided it did not provide
+any substancial advantage, while bringing some caveats: a compatible
+concrete syntax would have actually shared a lot of similar production
+rules than in this proposal, as most would be similar to Turtle's; but
+unlike SPARQL, the runtime semantics does **not** need to depend on
+(intermediate) result sets, which simplifies implementations and
+removes [incidental
+complexity](https://en.wikipedia.org/wiki/Accidental_complexity). In
+summary, the only advantage would have been to have a familiar syntax
+for those coming from SPARQL, but with a different runtime semantics
+even, which could have been confusing, even if compatible.
+ </p-->
+
+ <h2 id="intro-example">Example</h2>
+
<p>
The following RDF Graph will be used as an example through this specification. It describes the relation between a person named Tim Berners-Lee (denoted by <code><http://example.org/timbl#></code>) and two events he attended.
</p>