- From: Patrick Stickler <patrick.stickler@nokia.com>
- Date: Mon, 4 Apr 2005 21:07:10 +0300
- To: "ext Dan Connolly" <connolly@w3.org>
- Cc: public-rdf-dawg-comments@w3.org
On Apr 4, 2005, at 18:57, ext Dan Connolly wrote: >> Hmmm... I don't see a requirement for the query language >> to support arbitrary typed literals, stated either explicitly >> or subsumed by a requirement for the query language to >> allow matching of any RDF triple. > > The closest thing is perhaps... > > "3.1 RDF Graph Pattern Matching—Conjunction > The query language must include the capability to restrict matches on a > queried graph by providing a graph pattern, which consists of one or > more RDF triple patterns, to be satisfied in a query." > -- http://www.w3.org/TR/2005/WD-rdf-dawg-uc-20050325/#r3.1 > > >> I know that SPARQL presently provides for arbitrary >> typed literals, but it would still be good to see this >> requirement spelled out explicitly. >> >> Or perhaps I just missed it...? > > Perhaps 3.1 is explicit enough? I hadn't read it that way at first, but if I squint my eyes just right, I guess it does cover the general requirement about being able to express a query to match any RDF triple. OK. Good enough. Thanks, Patrick
Received on Monday, 4 April 2005 18:07:47 UTC