W3C home > Mailing lists > Public > public-rdf-comments@w3.org > June 2013

RE: [RDF-CONCEPTS] Skolemization

From: Markus Lanthaler <markus.lanthaler@gmx.net>
Date: Mon, 17 Jun 2013 11:22:57 +0200
To: <public-rdf-comments@w3.org>
Message-ID: <00dc01ce6b3c$41c71920$c5554b60$@lanthaler@gmx.net>
On Monday, June 17, 2013 10:37 AM, Andy Seaborne wrote:
> There seem to be 3 kinds of skolemization:
> 
> 1/ replacement (unconstrained; one-way)
> 
> 2/ round-trippable (the generating system can recover a bNode if the
> URI comes back; this was one of the original motivations)

I think the key point here is that it is done within the boundaries of a
single system you have control over.


> 3/ globalization (giving a recognizable identify to the bnode outside
> it's original context/data; the bnode is now transferrable to other
> systems; other systems can reverse the process)

Wouldn't that mean that a Skolem IRI === bNode and thus be at odds with the
definition of bnodes: "The blank nodes in an RDF graph are drawn from an
infinite set. This set is disjoint from the set of all IRIs and the set of
all literals".


--
Markus Lanthaler
@markuslanthaler
Received on Monday, 17 June 2013 09:23:26 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:29:57 UTC