--- a/ldpatch.html Thu Nov 20 00:10:03 2014 -0500
+++ b/ldpatch.html Thu Nov 20 12:02:06 2014 +0100
@@ -231,7 +231,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 URIs, 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="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).
</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.-->
@@ -249,7 +249,7 @@
<section class='normative' id='semantics'>
<h1>LD Patch Semantics</h1>
<p>
-An LD Patch document is applied to a Linked Data resource identified by an URI (the <dfn>target URI</dfn>) and represented by an RDF graph (the <dfn>target graph</dfn>). It is made of a prologue and a list of statements, where the order is relevant. The prologue declares a number of <a>prefixes</a> used to abbreviate URIs. Then each statement either binds a variable to a matching node from the <a>target graph</a>, or specified a modification on the <a>target graph</a>.
+An LD Patch document is applied to a Linked Data resource identified by an IRI (the <dfn>target IRI</dfn>) and represented by an RDF graph (the <dfn>target graph</dfn>). It is made of a prologue and a list of statements, where the order is relevant. The prologue declares a number of <a>prefixes</a> used to abbreviate IRIs. Then each statement either binds a variable to a matching node from the <a>target graph</a>, or specified a modification on the <a>target graph</a>.
</p>
@@ -258,10 +258,10 @@
<p>
@@ TODO should defer to Turtle's syntax. Not only Prefixes, but everything in http://www.w3.org/TR/2014/REC-turtle-20140225/#language-features. Proposed section name: Inherited from (the?) Turtle language. @@
-LD Patch offers the possibility to abbreviate URIs by using <a href="http://www.w3.org/TR/turtle/">Turtle</a>'s <code>@prefix</code> directive that allows declaring a short prefix name for a long prefix of repeated URIs. This is useful for many RDF vocabularies that are all defined in nearby namespace URIs [[!rdf11-concepts]], possibly using XML's namespace mechanism [[!xml-names11]] that works in a similar fashion.
+LD Patch offers the possibility to abbreviate IRIs by using <a href="http://www.w3.org/TR/turtle/">Turtle</a>'s <code>@prefix</code> directive that allows declaring a short prefix name for a long prefix of repeated IRIs. This is useful for many RDF vocabularies that are all defined in nearby namespace IRIs [[!rdf11-concepts]].
</p>
<p>
-Once a prefix such as <code>@prefix foo: <http://example.org/ns#></code> is defined, any mention of a URI later in the document may use a <a class="internalDFN" href="#grammar-production-PrefixedName">PrefixedName</a> that starts with <code>foo:</code> to stand for the longer URI. So for example, the <a class="internalDFN" href="#grammar-production-PrefixedName">PrefixedName</a> <code>foo:bar</code> is a shorthand for the URI <code><http://example.org/ns#bar></code>.
+Once a prefix such as <code>@prefix foo: <http://example.org/ns#></code> is defined, any mention of a IRI later in the document may use a <a class="internalDFN" href="#grammar-production-PrefixedName">PrefixedName</a> that starts with <code>foo:</code> to stand for the longer IRI. So for example, the <a class="internalDFN" href="#grammar-production-PrefixedName">PrefixedName</a> <code>foo:bar</code> is a shorthand for the IRI <code><http://example.org/ns#bar></code>.
</p>
</section>
@@ -283,9 +283,9 @@
LD Patch uses path expressions to describe possible routes through the <a>target graph</a> between two graph nodes. The main goal is to allow addressing a blank node by “walking” the arcs of the graph from an already identified node. A path is a sequence of <dfn>Step</dfn>s and <dfn>Constraint</dfn>s, which are applied in order to a set of nodes <var>ns</var>. <a>Step</a>s can be of three kinds:
</p>
<ul>
- <li>A <dfn>StepForward</dfn> is defined by a URI <var>p</var>, and consists in following the corresponding outgoing arcs: <var>ns</var> is replaced by the set of the objects of all triples from the <a>target graph</a> with predicate <var>p</a> and their subject in <var>ns</var>.</li>
- <li>A <dfn>StepBackward</dfn> is defined by a URI <var>p</var> preceded with the caret ("<code>^</code>") sign, and consists in following the corresponding incoming arcs: <var>ns</var> is replaced by the set of the subjects of all triples from the <a>target graph</a> with predicate <var>p</var> and their object in <var>ns</var>.</li>
- <li>A <dfn>StepAt</dfn> is defined by an integer <i>n</i>, and consists in following <var>n</var> <code>rdf:rest</code> arcs and one <code>rdf:first</code> arc in order to reach the corresponding member of an RDF collection. It is equivalent to a sequence of <var>n</var>+1 <a>StepForward</a>s wit the the corresponding URIs.</li>
+ <li>A <dfn>StepForward</dfn> is defined by a IRI <var>p</var>, and consists in following the corresponding outgoing arcs: <var>ns</var> is replaced by the set of the objects of all triples from the <a>target graph</a> with predicate <var>p</a> and their subject in <var>ns</var>.</li>
+ <li>A <dfn>StepBackward</dfn> is defined by a IRI <var>p</var> preceded with the caret ("<code>^</code>") sign, and consists in following the corresponding incoming arcs: <var>ns</var> is replaced by the set of the subjects of all triples from the <a>target graph</a> with predicate <var>p</var> and their object in <var>ns</var>.</li>
+ <li>A <dfn>StepAt</dfn> is defined by an integer <i>n</i>, and consists in following <var>n</var> <code>rdf:rest</code> arcs and one <code>rdf:first</code> arc in order to reach the corresponding member of an RDF collection. It is equivalent to a sequence of <var>n</var>+1 <a>StepForward</a>s wit the the corresponding IRIs.</li>
</ul>
<p>
<a>Constraint</a>s can be of two kinds:
@@ -316,7 +316,7 @@
<section id="bind-statement">
<h2><dfn>Bind</dfn></h2>
<p>
- The <a>Bind</a> operation is used to create a new variable by binding or assigning an RDF Term to the variable. The process results in a variable being bound to exactly one node. The scope of the bound variable is the entire LD Patch document: use of a given variable name anywhere in an LD Patch document identifies the same variable, although variables can be overriden in subsequent <a>Bind</a> statements. Following the example above, the <a>Bind</a> operation creates a new variable called <code>event</code>, starting from the RDF Term <code><#></code> and following the path expression <code>/schema:performerIn[/schema:url = <https://www.w3.org/2012/ldp/wiki/F2F5>]</code> in order to identify the RDF Term to which this variable will be bound to – i.e. <code>_:b2</code>.
+ The <a>Bind</a> operation is used to create a new variable by binding or assigning an RDF Term to the variable. The process results in a variable being bound to exactly one node. The scope of the bound variable is the entire LD Patch document: uses of a given variable name anywhere in an LD Patch document identifies the same variable, although variables can be overriden in subsequent <a>Bind</a> statements. Following the example above, the <a>Bind</a> operation creates a new variable called <code>event</code>, starting from the RDF Term <code><#></code> and following the path expression <code>/schema:performerIn[/schema:url = <https://www.w3.org/2012/ldp/wiki/F2F5>]</code> in order to identify the RDF Term to which this variable will be bound to – i.e. <code>_:b2</code>.
<pre class='example'>
Bind ?event <#> /schema:performerIn[/schema:url = <https://www.w3.org/2012/ldp/wiki/F2F5>] .
</pre>
@@ -435,7 +435,7 @@
<ul>
<li id="bind-unique-match">If a <a>Bind</a> statement fails to match exactly one node, then a 422 (Unprocessable Entity) status MUST be returned.</li>
<li id="unicity-constraint-violated">If a <a>Unicity constraint</a> is violated, then a 422 (Unprocessable Entity) status MUST be returned.</li>
- <li id="cut-nothing">If a <a>Cut</a> operation fail to remove any triple, then a 422 (Unprocessable Entity) status MUST be returned.</li>
+ <li id="cut-nothing">If a <a>Cut</a> operation fails to remove any triple, then a 422 (Unprocessable Entity) status MUST be returned.</li>
<li id="delete-non-existing-triple">If a <a>Delete</a> attempts to remove a non-existing triple, then a 422 (Unprocessable Entity) status MUST be returned.</li>
<li id="updatelist-non-list-argument">If the <a class="internalDFN" href="#grammar-production-subject">subject</a> and <a class="internalDFN" href="#grammar-production-predicate">predicate</a> provided to a <a>UpdateList</a> operation fail to match a collection, then a 422 (Unprocessable Entity) status MUST be returned.</li>
</ul>
@@ -452,7 +452,7 @@
<p>
There exists a particular case which LD Patch is not able to address. Given an RDF graph <var>G</var>, a blank node <var>b</var> is said to be unambiguous in <var>G</var> if there exists a couple <var>(n, p)</var> where
<ul>
- <li><var>n</var> is a URI or a literal</li>
+ <li><var>n</var> is a IRI or a literal</li>
<li><var>p</var> is an LD <a>Path Expression</a></li>
</ul>
such that applying <var>p</var> to {<var>n</var>} results in the singleton set {<var>b</var>}.
@@ -482,7 +482,7 @@
</p-->
<p>
- Another example is a graph containing only blank nodes. All its nodes are therefore ambiguous as they can not be reached from a URI or a literal. Such a graph is not interesting in the context of Linked Data as it contains no URI to link to or from it.
+ Another example is a graph containing only blank nodes. All its nodes are therefore ambiguous as they can not be reached from a IRI or a literal. Such a graph is not interesting in the context of Linked Data as it contains no IRI to link to or from it.
</p>
<p>