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

Re: On told-bnodes in queries

From: Seaborne, Andy <andy.seaborne@hp.com>
Date: Thu, 03 Nov 2005 19:59:57 +0000
Message-ID: <436A6C3D.4000100@hp.com>
To: andy.seaborne@hp.com
Cc: Enrico Franconi <franconi@inf.unibz.it>, Pat Hayes <phayes@ihmc.us>, RDF Data Access Working Group <public-rdf-dawg@w3.org>



Seaborne, Andy wrote:
> 
. . .

> 
> -------
> 
> Bijan's example [1] is a single basic graph pattern.
> 
> Suggestion: for this version of SPARQL, entailment beyond what can be 
> done by logical closure only applies to queries with a single basic 
> pattern matching Maybe some restricted set of FILTERs as well.
> 
> The rest of the algebra applies to abstract syntax queries (and hence 
> over logical closures).  We hope a later working group will extend the 
> algebra to entailment uses based on reseach done between the end of the 
> WG and the start of the next.
> 
> Question to everyone: the best way to this would be a concrete use case 
> for entailment beyond RDFS that isn't covered.  Anyone got one?
> 

More - there could be further restrictions such as:

1/ No told bNodes - I guess this is necessary
2/ Even no bNodes in the query at all - that might be restrictive on syntax 
but may be acceptable.


>     Andy
> 
> (*)
> [1] 
> http://lists.w3.org/Archives/Public/public-rdf-dawg/2005JulSep/0498.html
> 
>>
>> cheers
>> --e.
>>
> 
> 
Received on Thursday, 3 November 2005 20:00:19 GMT

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