- From: Dan Connolly <connolly@w3.org>
- Date: Tue, 08 Jun 2004 17:48:23 -0500
- To: Rob Shearer <Rob.Shearer@networkinference.com>
- Cc: Kendall Clark <kendall@monkeyfist.com>, Jim Hendler <hendler@cs.umd.edu>, RDF Data Access Working Group <public-rdf-dawg@w3.org>
On Tue, 2004-06-08 at 17:39, Rob Shearer wrote: > > "The protocol should allow construction of notional RDF > > graphs inferred (e.g. using standardized semantics such > > as RDFS, OWL or emerging technologies such as SWRL or N3 > > rules) so that queries may be posed against the inferred > > knowledge base." > > I have a problem with that because it seems to imply that all knowlege > *about* an RDF graph can be encoded *within* an RDF graph, and that's > clearly not the case. (The charter similar slants things this way as > well, which I think is a mistake.) Well, this is a limited way of layering query on inference, but the limitation is intentional in the charter, I believe. If lots of WG members want the charter changed, I can look into that. > It's perfectly sensible to know, for > example, that an RDF graph must contain at least one of two possible > triples, but not which one. Are you allowed to use that information to > help answer queries about the graph? I think it would be a major mistake > to make the use of such information a violation of the spec. -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Tuesday, 8 June 2004 18:47:58 UTC