--- a/ldpatch-20150728.html Fri Jul 24 15:43:19 2015 -0400
+++ b/ldpatch-20150728.html Fri Jul 24 16:30:33 2015 -0400
@@ -187,7 +187,7 @@
color: #999;
}
</style><link rel="stylesheet" href="https://www.w3.org/StyleSheets/TR/W3C-WG-NOTE"><!--[if lt IE 9]><script src='https://www.w3.org/2008/site/js/html5shiv.js'></script><![endif]--></head>
- <body class="h-entry" data-feedly-mini="yes" role="document" id="respecDocument"><div class="head" role="contentinfo" id="respecHeader">
+ <body class="h-entry" data-feedly-mini="yes" id="respecDocument"><div class="head" role="contentinfo" id="respecHeader">
<p>
@@ -197,11 +197,11 @@
</p>
<h1 class="title p-name" id="title" property="dcterms:title">Linked Data Patch Format</h1>
- <h2 id="w3c-working-group-note-24-july-2015"><abbr title="World Wide Web Consortium">W3C</abbr> Working Group Note <time property="dcterms:issued" class="dt-published" datetime="2015-07-24">24 July 2015</time></h2>
+ <h2 id="w3c-working-group-note-24-july-2015"><abbr title="World Wide Web Consortium">W3C</abbr> Working Group Note <time property="dcterms:issued" class="dt-published" datetime="2015-07-28">28 July 2015</time></h2>
<dl>
<dt>This version:</dt>
- <dd><a class="u-url" href="http://www.w3.org/TR/2015/NOTE-ldpatch-20150724/">http://www.w3.org/TR/2015/NOTE-ldpatch-20150724/</a></dd>
+ <dd><a class="u-url" href="http://www.w3.org/TR/2015/NOTE-ldpatch-20150728/">http://www.w3.org/TR/2015/NOTE-ldpatch-20150728/</a></dd>
<dt>Latest published version:</dt>
<dd><a href="http://www.w3.org/TR/ldpatch/">http://www.w3.org/TR/ldpatch/</a></dd>
@@ -291,7 +291,7 @@
<p>
- This document was published by the <a href="http://www.w3.org/2012/ldp">Linked Data Platform Working Group</a> as a Working Group Note.
+ This document was published by the <a href="http://www.w3.org/2012/ldp/">Linked Data Platform Working Group</a> as a Working Group Note.
If you wish to make comments regarding this document, please send them to
@@ -320,10 +320,7 @@
<a id="sotd_patent" property="w3p:patentRules" href="http://www.w3.org/Consortium/Patent-Policy-20040205/">5 February 2004 <abbr title="World Wide Web Consortium">W3C</abbr> Patent
Policy</a>.
-
-
-
- <abbr title="World Wide Web Consortium">W3C</abbr> maintains a <a href="http://www.w3.org/Consortium/Patent-Policy-20040205/" rel="disclosure">public list of any patent
+ <abbr title="World Wide Web Consortium">W3C</abbr> maintains a <a href="http://www.w3.org/2004/01/pp-impl/55082/status" rel="disclosure">public list of any patent
disclosures</a>
made in connection with the deliverables of the group; that page also includes
@@ -333,23 +330,21 @@
Claim(s)</a> must disclose the information in accordance with
<a href="http://www.w3.org/Consortium/Patent-Policy-20040205/#sec-Disclosure">section
6 of the <abbr title="World Wide Web Consortium">W3C</abbr> Patent Policy</a>.
-
-
</p>
<p>This document is governed by the <a id="w3c_process_revision" href="http://www.w3.org/2014/Process-20140801/">1 August 2014 <abbr title="World Wide Web Consortium">W3C</abbr> Process Document</a>.
</p>
+</section>
+<section id="toc"><h2 class="introductory" id="h-toc" resource="#h-toc"><span property="xhv:role" resource="xhv:heading">Table of Contents</span></h2><ul class="toc" role="directory" id="respecContents"><li class="tocline"><a href="#introduction" class="tocxref"><span class="secno">1. </span>Introduction</a></li><li class="tocline"><a href="#examples" class="tocxref"><span class="secno">2. </span>Examples</a><ul class="toc"><li class="tocline"><a href="#full-example" class="tocxref"><span class="secno">2.1 </span>Full example</a></li><li class="tocline"><a href="#list-manipulation-examples" class="tocxref"><span class="secno">2.2 </span><code>rdf:List</code> manipulation examples</a></li></ul></li><li class="tocline"><a href="#conformance" class="tocxref"><span class="secno">3. </span>Conformance</a></li><li class="tocline"><a href="#semantics" class="tocxref"><span class="secno">4. </span>LD Patch Semantics</a><ul class="toc"><li class="tocline"><a href="#nodes-and-triples-semantics" class="tocxref"><span class="secno">4.1 </span><span data-dfn-type="dfn">Nodes and triples Semantics</span></a></li><li class="tocline"><a href="#path-expression" class="tocxref"><span class="secno">4.2 </span><span data-dfn-type="dfn">Path Expression</span></a></li><li class="tocline"><a href="#patch-operations" class="tocxref"><span class="secno">4.3 </span>Patch Operations</a><ul class="toc"><li class="tocline"><a href="#Bind-statement" class="tocxref"><span class="secno">4.3.1 </span><span data-dfn-type="dfn">Bind</span></a></li><li class="tocline"><a href="#Add-statement" class="tocxref"><span class="secno">4.3.2 </span><span data-dfn-type="dfn">Add</span></a></li><li class="tocline"><a href="#AddNew-statement" class="tocxref"><span class="secno">4.3.3 </span><span data-dfn-type="dfn">AddNew</span></a></li><li class="tocline"><a href="#Delete-statement" class="tocxref"><span class="secno">4.3.4 </span><span data-dfn-type="dfn">Delete</span></a></li><li class="tocline"><a href="#DeleteExisting-statement" class="tocxref"><span class="secno">4.3.5 </span><span data-dfn-type="dfn">DeleteExisting</span></a></li><li class="tocline"><a href="#Cut-statement" class="tocxref"><span class="secno">4.3.6 </span><span data-dfn-type="dfn">Cut</span></a></li><li class="tocline"><a href="#UpdateList-statement" class="tocxref"><span class="secno">4.3.7 </span><span data-dfn-type="dfn">UpdateList</span></a></li><li class="tocline"><a href="#error-handling" class="tocxref"><span class="secno">4.3.8 </span><span data-dfn-type="dfn">Error Handling</span></a></li><li class="tocline"><a href="#pathological-graph" class="tocxref"><span class="secno">4.3.9 </span><span data-dfn-type="dfn">Pathological Graph</span></a></li></ul></li></ul></li><li class="tocline"><a href="#turtle-sparql-comparison" class="tocxref"><span class="secno">5. </span>LD Patch compared to Turtle and SPARQL</a></li><li class="tocline"><a href="#concrete-syntax" class="tocxref"><span class="secno">6. </span>Concrete Syntax</a></li><li class="tocline"><a href="#updatelist-algo" class="tocxref"><span class="secno">A. </span>UpdateList Algorithm</a></li><li class="tocline"><a href="#media-registration" class="tocxref"><span class="secno">B. </span>Internet Media Type, File Extension and Macintosh File Type</a></li><li class="tocline"><a href="#acknowledgements" class="tocxref"><span class="secno">C. </span>Acknowledgements</a></li><li class="tocline"><a href="#changelog" class="tocxref"><span class="secno">D. </span>Change Log</a><ul class="toc"><li class="tocline"><a href="#changes-since-march-2015-candidate-recommendation" class="tocxref"><span class="secno">D.1 </span>Changes since <span class="formerLink">March 2015 Candidate Recommendation</span></a></li><li class="tocline"><a href="#changes-since-september-2014-first-public-working-draft" class="tocxref"><span class="secno">D.2 </span>Changes since <span class="formerLink">September 2014 First Public Working Draft</span></a></li></ul></li><li class="tocline"><a href="#references" class="tocxref"><span class="secno">E. </span>References</a><ul class="toc"><li class="tocline"><a href="#normative-references" class="tocxref"><span class="secno">E.1 </span>Normative references</a></li><li class="tocline"><a href="#informative-references" class="tocxref"><span class="secno">E.2 </span>Informative references</a></li></ul></li></ul></section>
-</section>
-
<section class="informative" id="introduction" typeof="bibo:Chapter" resource="#introduction" property="bibo:hasPart">
<!--OddPage--><h2 id="h-introduction" resource="#h-introduction"><span property="xhv:role" resource="xhv:heading"><span class="secno">1. </span>Introduction</span></h2><p><em>This section is non-normative.</em></p>
<p>
- Linked Data <q cite="http://en.wikipedia.org/wiki/Linked_data">describes a method of publishing structured data so that it can be interlinked and become more useful. It builds upon standard Web technologies such as HTTP, RDF and IRIs, but rather than using them to serve web pages for human readers, it extends them to share information in a way that can be read automatically by computers. This enables data from different sources to be connected and queried.</q> (source Wikipedia).
+ Linked Data <q cite="https://en.wikipedia.org/wiki/Linked_data">describes a method of publishing structured data so that it can be interlinked and become more useful. It builds upon standard Web technologies such as HTTP, RDF and IRIs, but rather than using them to serve web pages for human readers, it extends them to share information in a way that can be read automatically by computers. This enables data from different sources to be connected and queried.</q> (source Wikipedia).
</p>
<p>
This document defines the Linked Data Patch Format (LD Patch), a format for describing changes to apply to Linked Data. It is suitable for use with <a href="http://tools.ietf.org/html/rfc5789">HTTP PATCH</a> [<cite><a class="bibref" href="#bib-RFC5789">RFC5789</a></cite>], a method to perform partial modifications to Web resources.
@@ -510,7 +505,7 @@
<div class="example"><div class="example-title"><span>Example 10</span></div><pre class="example"><#> <http://example.org/vocab#preferredLanguages> ( "lorem" "ipsum" "dolor" "sit" "amet" "en" "fr" ) .</pre></div>
- <h3 id="replace-elements">How to replace all the elements after a given index</h3>
+ <h3 id="replace-elements-after-index">How to replace all the elements after a given index</h3>
<p>
This example shows how to replace all the elements after the index <code>2</code> with the provided collection:
@@ -1457,12 +1452,14 @@
<section id="changes-since-march-2015-candidate-recommendation" typeof="bibo:Chapter" resource="#changes-since-march-2015-candidate-recommendation" property="bibo:hasPart">
<h3 id="h-changes-since-march-2015-candidate-recommendation" resource="#h-changes-since-march-2015-candidate-recommendation"><span property="xhv:role" resource="xhv:heading"><span class="secno">D.1 </span>Changes since <a href="http://www.w3.org/TR/2015/CR-ldpatch-20150303/">March 2015 Candidate Recommendation</a></span></h3>
<ul>
- <li>Closed <a href="http://www.w3.org/2012/ldp/track/issues/156">ACTION-156</a> by changing reference to "bcp47, as used by turtle”, based on <a href="https://www.w3.org/International/track/issues/410">i18n-issue-410</a>.</li>
+ <li>Closed <a href="http://www.w3.org/2012/ldp/track/actions/156">ACTION-156</a> by changing reference to "bcp47, as used by turtle”, based on <a href="https://www.w3.org/International/track/issues/410">i18n-issue-410</a>.</li>
<li>Fixed example</li>
<li>Fixed typo resolution re: <a href="http://www.w3.org/2012/ldp/track/issues/102">ISSUE-102</a></li>
<li>Added Conformance section</li>
</ul>
- <h3 id="changes-since-september-2014-first-public-working-draft">Changes since <a href="http://www.w3.org/TR/2014/WD-ldpatch-20140918/">September 2014 First Public Working Draft</a></h3>
+ </section>
+ <section id="changes-since-september-2014-first-public-working-draft" typeof="bibo:Chapter" resource="#changes-since-september-2014-first-public-working-draft" property="bibo:hasPart">
+ <h3 id="h-changes-since-september-2014-first-public-working-draft" resource="#h-changes-since-september-2014-first-public-working-draft"><span property="xhv:role" resource="xhv:heading"><span class="secno">D.2 </span>Changes since <a href="http://www.w3.org/TR/2014/WD-ldpatch-20140918/">September 2014 First Public Working Draft</a></span></h3>
<ul>
<li>Negative indexes in Path and Slice (<a href="http://www.w3.org/2012/ldp/track/issues/102">ISSUE-102</a> and <a href="http://www.w3.org/2012/ldp/track/issues/104">ISSUE-104</a>)</li>
<li>New section comparing LD Patch with Turtle and SPARQL 1.1</li>
--- a/ldpatch.html Fri Jul 24 15:43:19 2015 -0400
+++ b/ldpatch.html Fri Jul 24 16:30:33 2015 -0400
@@ -228,7 +228,7 @@
<section class='informative' id='introduction'>
<h1>Introduction</h1>
<p>
- Linked Data <q cite="http://en.wikipedia.org/wiki/Linked_data">describes a method of publishing structured data so that it can be interlinked and become more useful. It builds upon standard Web technologies such as HTTP, RDF and IRIs, but rather than using them to serve web pages for human readers, it extends them to share information in a way that can be read automatically by computers. This enables data from different sources to be connected and queried.</q> (source Wikipedia).
+ Linked Data <q cite="https://en.wikipedia.org/wiki/Linked_data">describes a method of publishing structured data so that it can be interlinked and become more useful. It builds upon standard Web technologies such as HTTP, RDF and IRIs, but rather than using them to serve web pages for human readers, it extends them to share information in a way that can be read automatically by computers. This enables data from different sources to be connected and queried.</q> (source Wikipedia).
</p>
<p>
This document defines the Linked Data Patch Format (LD Patch), a format for describing changes to apply to Linked Data. It is suitable for use with <a href="http://tools.ietf.org/html/rfc5789">HTTP PATCH</a> [[!RFC5789]], a method to perform partial modifications to Web resources. <!-- The "text/ldpatch" media type is prospectively used to identify such LD Patch documents.-->
@@ -1375,11 +1375,13 @@
<section>
<h3>Changes since <a href="http://www.w3.org/TR/2015/CR-ldpatch-20150303/">March 2015 Candidate Recommendation</a></h3>
<ul>
- <li>Closed <a href="http://www.w3.org/2012/ldp/track/issues/156">ACTION-156</a> by changing reference to "bcp47, as used by turtle”, based on <a href="https://www.w3.org/International/track/issues/410">i18n-issue-410</a>.</li>
+ <li>Closed <a href="http://www.w3.org/2012/ldp/track/actions/156">ACTION-156</a> by changing reference to "bcp47, as used by turtle”, based on <a href="https://www.w3.org/International/track/issues/410">i18n-issue-410</a>.</li>
<li>Fixed example</li>
<li>Fixed typo resolution re: <a href="http://www.w3.org/2012/ldp/track/issues/102">ISSUE-102</a></li>
<li>Added Conformance section</li>
</ul>
+ </section>
+ <section>
<h3>Changes since <a href="http://www.w3.org/TR/2014/WD-ldpatch-20140918/">September 2014 First Public Working Draft</a></h3>
<ul>
<li>Negative indexes in Path and Slice (<a href="http://www.w3.org/2012/ldp/track/issues/102">ISSUE-102</a> and <a href="http://www.w3.org/2012/ldp/track/issues/104">ISSUE-104</a>)</li>