W3C home > Mailing lists > Public > www-rdf-interest@w3.org > June 2000

Re: lightweight reification

From: Pierre-Antoine CHAMPIN <champin@bat710.univ-lyon1.fr>
Date: Fri, 02 Jun 2000 10:18:24 +0200
Message-ID: <39376DD0.594F99C7@bat710.univ-lyon1.fr>
To: Graham Klyne <GK@Dial.pipex.com>
CC: RDF interest group <www-rdf-interest@w3.org>
Graham Klyne wrote:
> But reification described in M&S involves making a node resource for the
> statement, AND adding four graph arcs originating from that node.  If we
> can find a usable identity for the statement resource, then the four
> additional arcs aren't necessarily needed.

a reified statement has intrinsically these 4 properties (property in the general meaning, not RDF's), and the arcs are the way RDF expresses properties !

This does not mean that implementation must keep those arcs explicit (I agree there are better ways of doing it), but it's true that M&S may be misleading about it.

  Pierre-Antoine
Received on Friday, 2 June 2000 04:44:56 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:43 GMT