Michael Schneider wrote: > 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. > I've asked an HP librarian to look into this. More in a few days. Jeremy -- Hewlett-Packard Limited registered Office: Cain Road, Bracknell, Berks RG12 1HN Registered No: 690597 EnglandReceived on Wednesday, 15 August 2007 10:44:16 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:45:08 GMT