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

Re: Editorial changes in Section 2.5

From: Seaborne, Andy <andy.seaborne@hp.com>
Date: Mon, 30 Jan 2006 19:26:22 +0000
Message-ID: <43DE685E.3090305@hp.com>
To: Enrico Franconi <franconi@inf.unibz.it>
Cc: Pat Hayes <phayes@ihmc.us>, RDF Data Access Working Group <public-rdf-dawg@w3.org>



Enrico Franconi wrote:
> On 30 Jan 2006, at 19:01, Seaborne, Andy wrote:
> 
>> Enrico Franconi wrote:
>>
...
> 
>>> """
>>> Definition: Basic Graph Pattern E-matching
>>> Let E-entails be an E-entailment regime,
>>> BGP a basic graph pattern,
>>> G an RDF graph,
>>> G' a scoping graph for G,
>>> B a scoping set, and
>>> S a pattern solution.
>>> BGP E-matches G with pattern solution S with respect to a scoping  
>>> graph G' and scoping set B,
>>> if there is a basic graph pattern BGP' that is graph equivalent to BGP,
>>> such that:
>>> 1/ G' and BGP' do not share any blank node labels,
>>> 2/ (G' union S(BGP')) is a well-formed graph for the E-entailment,
>>> 3/ G E-entails (G' union S(BGP')),
>>> 4/ The range of S is equal to B.
>>> """
>>
>> Awaiting consensus.
> 
> I'm waiting for Pat's OK, then.

This definition was the outcome of the WG decision last week.  There needs to 
be stronger reasons for changing it.

	Andy
Received on Monday, 30 January 2006 19:26:28 GMT

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