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: Sun, 22 Jan 2006 20:24:31 +0100
Message-Id: <42326304-B83E-4531-B71E-CDDCB9F7268A@inf.unibz.it>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: Andy Seaborne <andy.seaborne@hp.com>


On 21 Jan 2006, at 20:43, Enrico Franconi wrote:

>
> I propose to have an explicit text to present the reader the  
> alternative semantics by Pat in a simple way, immediately before  
> "As an example of a Basic Graph Pattern:", as follows:
>
> "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 use a standard RDF merge instead of  
> an OrderedMerge."

Ooops! I meant a union, not a merge!

"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."
Received on Sunday, 22 January 2006 19:24:43 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:25 GMT