- From: Dan Connolly <connolly@w3.org>
- Date: Sun, 27 May 2001 12:29:57 -0500
- To: Aaron Swartz <aswartz@upclink.com>
- CC: Jan Grant <Jan.Grant@bristol.ac.uk>, RDFCore Working Group <w3c-rdfcore-wg@w3.org>
Aaron Swartz wrote: > > Dan Connolly <connolly@w3.org> wrote: > > >> Something conforms wrt the test case iff it interprets the RDF as > >> producing* a set of triples identical with the sample output, up to > >> reordering and the global renaming of anonymous resources. > > > > Right. > > > > It's too bad there's no way to reduce that to some sort/diff > > thingy, but there just isn't. It's inherently a graph-matching > > thing. > > Ehh? What are the issues with sorting the triples and providing some > algorithm for anonymous resource naming? You're welcome to give it a try, but I don't see any algorithm for naming the anonymous resources that's any simpler than graph matching. -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Sunday, 27 May 2001 13:30:02 UTC