- From: Enrico Franconi <franconi@inf.unibz.it>
- Date: Thu, 26 Jan 2006 12:22:17 +0100
- To: andy.seaborne@hp.com
- Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Since now you changed the text to have G no more equal to G', the following does not hold anymore: """ 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. Moreover, the uniqueness property of pattern solutions guarantees the interoperability between SPARQL systems: given a graph and a basic graph pattern, the set of all the pattern solutions is unique. """ So, if you want to keep the change, in both cases you have to add "modulo arbitrary renamings of the bnodes". Still, I argue that the change shouldn't have been made. cheers --e.
Received on Thursday, 26 January 2006 11:22:24 UTC