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

Re: lightweight reification

From: Graham Klyne <GK@dial.pipex.com>
Date: Fri, 02 Jun 2000 14:04:33 +0100
Message-Id: <4.3.1.2.20000602140117.00b515f0@pop.dial.pipex.com>
To: Pierre-Antoine CHAMPIN <champin@bat710.univ-lyon1.fr>
Cc: RDF interest group <www-rdf-interest@w3.org>
At 10:18 AM 6/2/00 +0200, Pierre-Antoine CHAMPIN wrote:
>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.

But, without a (common) way to _name_ a statement, the property values are 
the only way to identify it -- which leads back to full reification.

#g

------------
Graham Klyne
(GK@ACM.ORG)
Received on Friday, 2 June 2000 10:23:10 GMT

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