W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2005

Re: Comments on "SPARQL Query Language for RDF"

From: Seaborne, Andy <andy.seaborne@hp.com>
Date: Wed, 07 Sep 2005 13:30:41 +0100
Message-ID: <431EDD71.4020303@hp.com>
To: Enrico Franconi <franconi@inf.unibz.it>
CC: RDF Data Access Working Group <public-rdf-dawg@w3.org>



Enrico Franconi wrote:
> 1) On 2 Sep 2005, at 12:58, Seaborne, Andy wrote
> <http://www.w3.org/mid/43183071.1070508@hp.com>:
...

> 
> 3) On 2 Sep 2005, at 12:58, Seaborne, Andy wrote
> <http://www.w3.org/mid/43183071.1070508@hp.com>:
> 
>  > = Blank Nodes in Queries
>  >
>  > """
>  > A blank node in a query pattern “behaves as a variable; a blank node
>  > in a query pattern may match any RDF term”.
>  > """
>  >
>  > then the solution of a basic pattern is described in terms of
>  > matching variables.  This is supposed to cover the case of bNodes
>  > from the query pattern as they are treated as variables and so have
>  > bindings.
>  >
>  > Could you suggest wording that would make that clearer?
> 
> We suggest to update the definition of "pattern solution" to include
> explicitly the bnodes in addition to the variables.
> 
Changed to:
"""
Definition: Pattern Solution

Let W = V union RDF-B, the set of all variables and blank nodes.

A pattern solution is a substitution function from a subset of W to the set of 
RDF terms, RDF-T.

The result of replacing every member v of W in a graph pattern P by S(v) is 
written S(P).

If v is not in the domain of S then S(v) is defined to be v.
"""

	Andy




	Andy
Received on Wednesday, 7 September 2005 12:32:25 GMT

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