W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > May 2001

Re: Test cases: format of input and output

From: <jos.deroo.jd@belgium.agfa.com>
Date: Sun, 27 May 2001 20:10:12 +0100
To: aswartz@upclink.com
Cc: connolly@w3.org, Jan.Grant@bristol.ac.uk, w3c-rdfcore-wg@w3.org
Message-Id: <OF52119492.7B3A6158-ON41256A59.00689289@bayer-ag.com>


>> 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.
>
>I don't know what graph matching is

e.g. http://www.agfa.com/w3c/euler/danc-result.n3
is the result of a graph matching (for anonymous
resources) of
http://www.agfa.com/w3c/euler/danc-query.n3
onto
http://www.agfa.com/w3c/euler/danc.n3

The algorithm is pretty simple and can be found
as part of the eval and unify methods of
http://www.agfa.com/w3c/euler/Euler.java

--
Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Sunday, 27 May 2001 14:10:43 EDT

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:35:52 EDT