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

Re: A Rough Guide to Notation3

From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
Date: Sat, 24 Aug 2002 18:19:30 -0400 (EDT)
Message-Id: <20020824.181930.125117663.pfps@research.bell-labs.com>
To: seth@robustai.net
Cc: sandro@w3.org, sean@mysterylights.com, www-rdf-interest@w3.org

From: "Seth Russell" <seth@robustai.net>
Subject: Re: A Rough Guide to Notation3 
Date: Sat, 24 Aug 2002 12:47:17 -0700

> 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
> http://robustai.net/sailor/

You could forbid all self-referential sentences.  However, some
self-referential sentences are interesting, and forbidding any form of
self-reference goes against the RDF philosophy of being able to say
anything about anything.

Received on Saturday, 24 August 2002 18:19:42 UTC

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