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: http://www.websemanticsjournal.org/ps/pub/2005-23 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. Cheers, Michael -- Michael Schneider <m_schnei@gmx.de>Received on Tuesday, 14 August 2007 09:02:52 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:45:08 GMT