W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > January to March 2006

Re: Final text for Basic Graph Patterns

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Wed, 18 Jan 2006 00:28:42 +0100
Message-Id: <982F912F-3824-4FA4-8F1A-FEA7F1213F6C@inf.unibz.it>
Cc: Dan Connolly <connolly@w3.org>, Bijan Parsia <bparsia@isr.umd.edu>, RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: Pat Hayes <phayes@ihmc.us>

On 18 Jan 2006, at 00:14, Pat Hayes wrote:
> Well, I'll go along with the tide as far as I can, but the more I  
> think about this, the better the 'allow redundancy but deprecate  
> it' solution seems to be. I think we are on track to do a premature  
> optimization thingie here which will quite soon turn out to have  
> been just the kind of mistake we ought to have learned not to make.  
> But I'm not going to lie down in the road about it, to use a phrase  
> I recently learned from Bijan.

My main concern is that you would loose equivalence with subgraph  
matching. But see my previous email <http://www.w3.org/mid/ 
0BA83124-9557-4567-A3D0-E73504613968@inf.unibz.it> where I try to  
argue (while agreeing) with your arguments.

Received on Tuesday, 17 January 2006 23:29:02 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:50 UTC