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

AW: reification vs. named graphs

From: Valentin Zacharias <Zacharias@fzi.de>
Date: Tue, 14 Aug 2007 11:16:44 +0200
Message-ID: <0EF30CAA69519C4CB91D01481AEA06A0373C56@judith.fzi.de>
To: "Michael Schneider" <m_schnei@gmx.de>, <semantic-web@w3.org>
Cc: <jjc@hpl.hp.com>

the paper referred to is accessible here:
<http://www.wiwiss.fu-berlin.de/suhl/bizer/pub/NamedGraphs-WebSemanticsJourn
al.pdf> (<http://tinyurl.com/2b6bwo>)

cu

-- 
email: zacharias@fzi.de
phone: +49-721-9654-806
fax  : +49-721-9654-807
http://www.vzach.de/blog

=======================================================================
FZI  Forschungszentrum Informatik an der Universität Karlsruhe (TH)
Haid-und-Neu-Str. 10-14, 76131 Deutschland, http://www.fzi.de
SdbR, Az: 14-0563.1 Regierungspräsidium Karlsruhe
Vorstand: Rüdiger Dillmann, Michael Flor, Jivka Ovtcharova, Rudi Studer
Vorsitzender des Kuratoriums: Ministerialdirigent Günther Leßnerkraus
=======================================================================


> -----Ursprüngliche Nachricht-----
> Von: semantic-web-request@w3.org [mailto:semantic-web-request@w3.org]
> Im Auftrag von Michael Schneider
> Gesendet: Dienstag, 14. August 2007 11:03
> An: semantic-web@w3.org
> Cc: jjc@hpl.hp.com
> Betreff: reification vs. named graphs
> 
> 
> 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:17:03 GMT

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