W3C home > Mailing lists > Public > public-rdf-wg@w3.org > April 2011

Re: matching basic graph patterns

From: Andy Seaborne <andy.seaborne@epimorphics.com>
Date: Wed, 20 Apr 2011 17:33:27 +0100
Message-ID: <4DAF0AD7.6080106@epimorphics.com>
To: public-rdf-wg@w3.org


On 20/04/11 17:16, Peter Frederick Patel-Schneider wrote:
> Does anyone know where matching basic graph patterns is defined in the
> new SPARQL documents?  I just tried to find this definition and failed.
>
> peter
>

Peter,

http://www.w3.org/2009/sparql/docs/query-1.1/rq25.xml#BGPsparql

Whether the xsd:string/simple literal decision impacts that is something 
the (SPARQL-)WG needs consider.

Do you have an opinion or any guidance?

	Andy
Received on Wednesday, 20 April 2011 16:33:54 GMT

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