W3C home > Mailing lists > Public > public-swbp-wg@w3.org > December 2005

Re: [SKOS, SPARQL, ALL] Closure and SPARQL

From: David Wood <dwood@softwarememetics.com>
Date: Mon, 12 Dec 2005 13:13:08 -0500
Message-Id: <66BF740F-E8E9-4AE3-8445-85A41CEBEBFF@softwarememetics.com>
Cc: "Christoffel Dhaen" <christoffel@landcglobal.com>, <public-swbp-wg@w3.org>
To: Pat Hayes <phayes@ihmc.us> 

On 12 Dec2005, at 12:58, Pat Hayes wrote:
> RDF uses a graph *syntax*, but that is merely a syntactic  
> convention. Nothing follows from this about transitivity or  
> otherwise of the relations described by an RDF graph.

I think this may be the key to the different ways of thinking.  As  
far as I am concerned, RDF *is* a (particular type of) graph.  The  
syntactic conventions are its several serialization formats.  And, as  
a graph, RDF has a native concept of relations between things which  
are connected to other things via yet more things (transitivity).

Regards,
Dave
Received on Monday, 12 December 2005 18:13:22 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:17:19 GMT