W3C home > Mailing lists > Public > public-lod@w3.org > April 2011

Re: Linked Data, Blank Nodes and Graph Names

From: Richard Cyganiak <richard@cyganiak.de>
Date: Fri, 8 Apr 2011 13:02:08 +0100
Cc: public-lod@w3.org
Message-Id: <848D188A-BBAB-4B4E-AA09-13F89B0A82E0@cyganiak.de>
To: Michael Brunnbauer <brunni@netestate.de>
On 8 Apr 2011, at 08:11, Michael Brunnbauer wrote:
> I would prefer a way of skolemizing that does not depend on the graph name
> and can be done by producer *and* consumer of RDF on a voluntary base.
> It should be a standard with reference implementations in all important
> languages for:
> -generating a skolem URI
> -converting an unskolemized RDF serialization to a skolemized one
> -converting a skolemized RDF serialization to an unskolemized one
> It is important that skolem URIs would be recognizeable.

I tend to think that the best we can do w.r.t. blank nodes is exactly what you describe above, plus some guidance in the core RDF specs along the lines of [1] and [2].

On skolemization, Sandro started a document here [3] which perhaps could be shaped into some sort of draft.


[1] http://lists.w3.org/Archives/Public/semantic-web/2011Mar/0068.html
[2] http://richard.cyganiak.de/blog/2011/03/blank-nodes-considered-harmful/
[3] http://www.w3.org/wiki/BnodeSkolomization
Received on Friday, 8 April 2011 12:04:05 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:16:13 UTC