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

Re: Editorial thread for BGP matching

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Mon, 23 Jan 2006 18:38:32 +0100
Message-Id: <7185BF75-0283-4D70-A021-5FA594630F8F@inf.unibz.it>
Cc: Andy Seaborne <andy.seaborne@hp.com>, RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: Pat Hayes <phayes@ihmc.us>

On 23 Jan 2006, at 18:17, Pat Hayes wrote:
>> "In the case of simple entailment, if the scoping graph G' is such  
>> that it does not share blank nodes with BGP, then the above  
>> definition can be simplified to take the union between G' and BGP,  
>> instead of an OrderedMerge."
> This works for any kind of entailment,

No. It does not work for the extension with told-bnodes, unless you  
make exceptions :-)
...which hampers the smooth extensibility.

Received on Monday, 23 January 2006 17:38:44 UTC

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