- From: Massimo Marchiori <massimo@w3.org>
- Date: Tue, 7 May 2002 19:45:43 -0400
- To: www-rdf-comments@w3.org
- Cc: massimo@w3.org
I just quickly read (yes, same flight... ;) the new RDF Test Cases as per http://www.w3.org/TR/rdf-testcases/ In the main text (not time so far to read all the actual use cases... ;) there is in Section 2: <quote> A parser is considered to pass the test if it produces a graph isomorphic with the graph described by the N-triples output document. </quote> This is wrong, according to the standard definition of graph isomorphism (care when using words without ...!). You'd define it using the RDF-MT semantical equivalence instead. There are possible related issues of conformance here, but that's the only major error (or issue, depending... ;) I could find. Thanks, -M
Received on Tuesday, 7 May 2002 20:10:04 UTC