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

Re: reification vs. named graphs

From: Jeremy Carroll <jjc@hpl.hp.com>
Date: Wed, 15 Aug 2007 11:43:08 +0100
Message-ID: <46C2D8BC.7060309@hpl.hp.com>
To: Michael Schneider <m_schnei@gmx.de>
CC: semantic-web@w3.org



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 England
Received on Wednesday, 15 August 2007 10:44:16 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 21:45:17 GMT