A glimpse at LD Patch

All,

Here is a quick update to the status of LD Patch. Pierre-Antoine,
Andrei and I have been discussing a lot about the expressive power and
different approaches for the syntax. Those are now stable and we were
adapting our respective implementations to refine and simplify all the
rules. Those are now final and are very close to what Pierre-Antoine
shared with the group recently [1] (few changes to be expected).

In a nutshell, here is how we define LD Patch:
* Turtle inspired syntax
* you can add / delete RDF triples
* there is a special statement for handling lists and ranges in those lists
* you can't talk _directly_ about the BNodes from the graph (that's
the resolution we made during the last F2F)
* but you can refer to most of them through a simple Path expression
  * a la XPath but for graphs
  * very restricted in scope: moving forward/backward in graph, n-th
element of a list, filtering and unicity restriction
  * the semantics of Path apply to sets of RDF nodes, like XPath
* results from applying a Path to a set of nodes are bound to variables
* those variables can be used in other statements

I think we now have something stable enough to be flushed in a
document for people to start lookking at it. I would expect the FPWD
to have the full grammar, the abstract model and examples. I expect
the work on the semantics to take a couple more weeks as we need to
update our implementations.

Alexandre

[1] https://github.com/pchampin/rdfpatch

Received on Monday, 2 June 2014 16:10:23 UTC