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

Re: Wording change (was : Re: Final text for Basic Graph Patterns)

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Fri, 20 Jan 2006 00:23:04 +0100
Message-Id: <B2D1CA21-85AF-4DFC-A565-F90EDFC45AB3@inf.unibz.it>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: Pat Hayes <phayes@ihmc.us>

On 19 Jan 2006, at 19:32, Pat Hayes wrote:
>> Is it fixable? Who knows, probably yes, with some other lenghty  
>> proposal you may throw at us.
> I honestly do not think this is either lengthy or hard to state  
> precisely, or to understand. It comes up naturally as a kind of  
> side observation in the text that justifies why BGP and G' should  
> be standardized apart. It is entirely about allowing bnodes in G'  
> and BGP to be in a shared scope, or not; and this is exactly how it  
> would be stated. It isn't done by an elegant mathematical conjuring  
> trick (which, to repeat, as one definition-hacker to another, I  
> actually quite admire, but find hard to explain.)

That's my point. Your idea does not look formal and elegant to me and  
most importantly it relies mostly on definitions in natural language.  
Our definition is three formal bullets and it contains everything it  
should be told.

My final proposal: we use our idea with orderedmerge (which has  
already been massaged in a nice text in <http://www.w3.org/2001/sw/ 
DataAccess/rq23>, that still contains few minor imprecisions I'll  
point out in another mail), and immediately after Andy will provide  
the explanation of it by showing how it would be equivalent to the  
union and a more restricted scoping graph, exactly in the way he says  
that it is equivalent to subgraph matching.

Can you buy this compromise?

Received on Thursday, 19 January 2006 23:23:23 UTC

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