W3C home > Mailing lists > Public > semantic-web@w3.org > August 2007

reification vs. named graphs

From: Michael Schneider <m_schnei@gmx.de>
Date: Tue, 14 Aug 2007 11:02:43 +0200
Cc: jjc@hpl.hp.com
Message-ID: <20070814090243.22110@gmx.net>
To: semantic-web@w3.org

Hi (btw, whats-your.name? ;-))!

>>     G') everyone and his dog really love them for killing reification.
>> Well, this really looks like progress to me: After all, 6 of 7 of the >>above nagging issues have finally been fixed by replacing RDF reification >>with named graphs... :-)
>can you explain how to simulate reification using named graphs in >pseudocode?
>is there a wiki page explaining this?

There once was a paper which well explained the named graph approach: 


It also included a section about the relationship between named graphs and reification, and how a reification statement can be expressed by a named graph (the idea was to use a singleton named graph, if I correctly remember).

Regrettably, I currently get timeouts when trying to access this address.

I suppose, the authors of this paper (e.g. Jeremy Carroll) can tell you an alternative address, or even provide you with more current information.


Michael Schneider <m_schnei@gmx.de>
Received on Tuesday, 14 August 2007 09:02:52 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:47:27 UTC