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

Re: [OK] Re: [OK?] Re: comments on "SPARQL Query Language for RDF"

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Wed, 22 Mar 2006 17:12:11 +0100
Message-Id: <C48751B5-DC1B-428A-80DA-65E28AA8F34A@inf.unibz.it>
Cc: public-rdf-dawg-comments@w3.org
To: Peter F. Patel-Schneider <pfps@research.bell-labs.com>

On 22 Mar 2006, at 15:48, Peter F. Patel-Schneider wrote:
>>  From section 2.5.2:
>> "A pattern solution can then be defined as follows: to match a basic
>> graph pattern under simple entailment, it is possible to proceed by
>> finding a mapping from blank nodes and variables in the basic graph
>> pattern to terms in the graph being matched; a pattern solution is
>> then a mapping restricted to just the variables, possibly with blank
>> nodes renamed. Moreover, a uniqueness property guarantees the
>> interoperability between SPARQL systems: given a graph and a basic
>> graph pattern, the set of all the pattern solutions is unique up to
>> blank node renaming."
> This is a claim, not a theorem (with proof).

Sure :-)
Stay tuned for the explicit proof.
Received on Wednesday, 22 March 2006 16:12:21 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:52:07 UTC