W3C home > Mailing lists > Public > www-rdf-interest@w3.org > August 2002

Re: A Rough Guide to Notation3

From: Seth Russell <seth@robustai.net>
Date: Sat, 24 Aug 2002 12:47:17 -0700
Message-ID: <00c301c24ba7$0e4f60e0$657ba8c0@c1457248a.sttls1.wa.home.com>
To: <sandro@w3.org>, "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>
Cc: <sean@mysterylights.com>, <www-rdf-interest@w3.org>

From: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>

> The problem is not their (potential) existence.  It is their existence
> everywhere.  The problem is that if you allow self-referential
> sentences and also need to have sentences exists everywhere, removing just
> the problematic ones is problematic.

If we detect the self referential loop as we merge graphs, then why is it
problematic?  We simply could not construct a graph with a loop.

Seth Russell
Received on Saturday, 24 August 2002 15:48:09 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:44:37 UTC