W3C home > Mailing lists > Public > www-rdf-interest@w3.org > April 2002

RE: Explicit Disambiguation Via RDF bNodes, more Process

From: Bill de hÓra <dehora@eircom.net>
Date: Sat, 27 Apr 2002 10:41:23 +0100
To: "'Bill de hÓra'" <dehora@eircom.net>, "'Joshua Allen'" <joshuaa@microsoft.com>, "'Danny Ayers'" <danny666@virgilio.it>, "'Sandro Hawke'" <sandro@w3.org>, <www-rdf-interest@w3.org>
Message-ID: <000701c1edcf$b29d21e0$887ba8c0@mitchum>
 
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1



> Bill de hÓra
>
> It matters; for example you can't just merge two bnodes together,

Let me temper that. You can do what you like, but you can't merge
bnodes without adding information that isn't entailed from the
original graphs.

Bill de hÓra

-----BEGIN PGP SIGNATURE-----
Version: PGP 7.0.4

iQA/AwUBPMpyQ+aWiFwg2CH4EQJCxQCeKIqjgRkKr9P3CbboeVeVy5ZltHYAoKYi
DrF+ryOjw3RJzOWGj5sraOIu
=TTGg
-----END PGP SIGNATURE-----
Received on Saturday, 27 April 2002 05:48:36 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:53 GMT