Re: Test cases: format of input and output

>> 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 UTC