- From: Rob Shearer <Rob.Shearer@networkinference.com>
- Date: Tue, 20 Jul 2004 09:16:10 -0700
- To: "Dan Connolly" <connolly@w3.org>, "Yoshio Fukushige" <fukushige.yoshio@jp.panasonic.com>
- Cc: "RDF Data Access Working Group" <public-rdf-dawg@w3.org>, <fuku@w3.org>
> I think clarifying "by the query" to "by the queried graph" is > worthwhile: > > [[ > The query language must include the capability to restrict > matches on a > queried graph based on a disjunction of graph patterns, at > least one of > which must be satisfied by the queried graph. > ]] This issue was immediately noticed at the f2f, and I believe the requirement we voted on simply dropped the last prepositional phrase: "...at least one of which must be satisfied."
Received on Tuesday, 20 July 2004 12:18:32 UTC