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

Re: rdfc25May.n3 testcase

From: <jos.deroo.jd@belgium.agfa.com>
Date: Wed, 30 May 2001 19:05:59 +0100
To: connolly@w3.org
Cc: w3c-rdfcore-wg@w3.org
Message-Id: <OF4A8695EB.D4B834F1-ON41256A5C.0062267B@bayer-ag.com>


[...]
thanks!

> > So I am in doubt now...
>
> It's not clear what you're in doubt about.
> Is it about the use of N3 for test case output?

certainly not!

> Or about the idea of graph matching on
> expected results in general?

It's going better now. If we unify lets say 2
anonymous nodes, we need the kind of
property-of-property stuff you just mentioned
(which is actually just asserting another n3
set of statements)
I will certainly come back on that

--
Jos De Roo, AGFA http://www.agfa.com/
Received on Wednesday, 30 May 2001 13:06:08 EDT

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