Re: Closing rdfms-difference-between-ID-and-about (was: RDFCore WG minutes for the telecon 2001-10-12) from jos.deroo.jd@belgium.agfa.com on 2001-10-24 (w3c-rdfcore-wg@w3.org from October 2001)

From: <jos.deroo.jd@belgium.agfa.com>
Date: Wed, 24 Oct 2001 17:56:19 +0100
To: phayes@ai.uwf.edu
Cc: bwm@hplb.hpl.hp.com, w3c-rdfcore-wg@w3.org
Message-Id: <OFEB0E23E9.79B370C2-ON41256AEF.005CE56E@bayer-ag.com>

[...]
>>Can we extend the notion of a tidy graph so that it removes
>>duplicate statements.  Any untidy graph has an equivalent tidy
>>graph, and the model theory is defined in terms of that.
>
>Yes, we can do that. Everyone go on that?

yes

--
Jos

Received on Wednesday, 24 October 2001 12:12:54 UTC