W3C home > Mailing lists > Public > www-rdf-logic@w3.org > June 2001

Re: rdf as a base for other languages

From: pat hayes <phayes@ai.uwf.edu>
Date: Mon, 4 Jun 2001 20:39:28 -0500
Message-Id: <v04210117b741e6f241de@[205.160.76.219]>
To: Sandro Hawke <sandro@w3.org>
Cc: las@olin.edu, www-rdf-logic@w3.org
>pat sez:
> > My point was that even with a (full) understanding of how to
> > interpret the RDF, it still wouldnt be a translation of disjunction.
> > Disjunction is not expressible in RDF.
> >
> > (I might add that I would not keep going on about this if people
> > (like Sandro) didnt keep saying the opposite.)
>
>I'm not saying disjunction is expressible in RDF [caveat below].  I'm
>saying, of course, that disjunction is expressible in a language which
>can be layered on RDF, and talking about how we might work with that
>layering

OK, sorry I misunderstood. But then let us get clear about this 
'layering on' and how it is going to be managed. It sounds like RDF 
needs some basic mechanism for indicating layers, or at any rate for 
distinguishing 'actual' RDF (ground binary relational assertions) 
from 'bottom-layer-of-something-else' RDF . I think that just this 
would go a long way.

>(which is why I was getting into performatives)

You lost me there, I confess, as I don't see how performatives come 
into the equation.  But this may be a side issue.

Pat

---------------------------------------------------------------------
IHMC					(850)434 8903   home
40 South Alcaniz St.			(850)202 4416   office
Pensacola,  FL 32501			(850)202 4440   fax
phayes@ai.uwf.edu 
http://www.coginst.uwf.edu/~phayes
Received on Monday, 4 June 2001 21:39:39 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:40 GMT