- From: Dan Connolly <connolly@w3.org>
- Date: Tue, 20 Jul 2004 11:20:33 -0500
- To: Yoshio Fukushige <fukushige.yoshio@jp.panasonic.com>
- Cc: Rob Shearer <Rob.Shearer@networkinference.com>, RDF Data Access Working Group <public-rdf-dawg@w3.org>, fuku@w3.org
On Tue, 2004-07-20 at 11:09, Dan Connolly wrote: > On Tue, 2004-07-20 at 10:54, Dan Connolly wrote: > [...] > > I think clarifying "by the query" to "by the queried graph" is > > worthwhile: > > > > [[ > > The query language must include the capability to restrict matches > > oops; "restrict matches" is goofy. hmm. > > > on a > > queried graph based on a disjunction of graph patterns, at least one of > > which must be satisfied by the queried graph. > > ]] I think "compute" will work in place of "restrict": [[ The query language must include the capability to compute matches on a queried graph based on a disjunction of graph patterns, at least one of which must be satisfied by the queried graph. ]] hmm... to speak of a language including an ability to compute is a little awkward... languages express things... but... I think this is close enough. -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Tuesday, 20 July 2004 12:20:40 UTC