- From: Dan Connolly <connolly@w3.org>
- Date: 31 May 2002 16:32:47 -0500
- To: patrick hayes <phayes@ai.uwf.edu>
- Cc: Jan Grant <Jan.Grant@bristol.ac.uk>, Jeremy Carroll <jjc@hplb.hpl.hp.com>, w3c-rdfcore-wg@w3.org
On Fri, 2002-05-31 at 15:57, patrick hayes wrote: [...] > Or, we could say that two graphs are equivalent if they are instances > of each other. That's how I think of it. If you can use that notion without going madly circular, I suggest doing so. > That is a stronger relationship, since equivalent > graphs need not be graph-isomorphic (example in > http://www.w3.org/TR/rdf-mt/#graphdefs) but they might as well be as > far as their meaning is concerned. It was tricky to get 'instance' > right, by the way. -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Friday, 31 May 2002 17:33:15 UTC