- From: Eric Prud'hommeaux <eric@w3.org>
- Date: Sat, 14 May 2011 20:33:21 +0200
- To: Richard Cyganiak <richard@cyganiak.de>
- Cc: public-rdf-wg@w3.org
* Richard Cyganiak <richard@cyganiak.de> [2011-05-13 16:01+0100] > On 13 May 2011, at 15:35, Eric Prud'hommeaux wrote: > > 1. no MAY wording - I want SPARQL, N3, and every other system which > > is allowed to work over the unentailed graph to be working with the > > same graph. > > Why? > > > 6. either DO or DON'T (no MAY) canonicalize the beloved datatypes in > > XSD. (Again, this serves as advice to e.g. parsers and APIs). > > Why? To both, it's so that there's some uniformity of behavior. I wouldn't want to be the user of (nor the designer of test cases for) a Semantic Web which will unpredictably match strings in graph patterns. (I'm assuming here that users will continue to work on graphs without e.g. D-entailment; which I think is pretty reallistic.) > Best, > Richard -- -ericP
Received on Saturday, 14 May 2011 18:33:52 UTC