- From: Dan Connolly <connolly@w3.org>
- Date: Thu, 11 Mar 2004 09:02:07 -0600
- To: Janne Saarela <janne.saarela@profium.com>
- Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
On Thu, 2004-03-11 at 08:30, Janne Saarela wrote: > Very good starting point. Formally may I suggest > we could use logic programming notation such > > (X, FN:name, "John Smith") Umm... why? Is that a notation we expect our audience to use when making their feature requests? > The evaluation result would then be either bindings > for X or if closure is a requirement, we would return > all triples with X bound to a different value. > > I would like to see closure implemented with the query > language in order to enable refined queries over > the result graph. Can you motivate this feature with a use case? i.e. a plausible story from real life? > > Let me post another email about inference. > > Janne -- Dan Connolly, W3C http://www.w3.org/People/Connolly/ see you at the WWW2004 in NY 17-22 May?
Received on Thursday, 11 March 2004 10:01:03 UTC