- From: Enrico Franconi <franconi@inf.unibz.it>
- Date: Wed, 22 Mar 2006 17:12:11 +0100
- To: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
- Cc: public-rdf-dawg-comments@w3.org
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. --e.
Received on Wednesday, 22 March 2006 16:12:21 UTC