W3C home > Mailing lists > Public > www-rdf-interest@w3.org > February 2004

Re: RDF Triples in XML, named graphs

From: Benja Fallenstein <b.fallenstein@gmx.de>
Date: Fri, 13 Feb 2004 01:11:40 +0200
Message-ID: <402C082C.9010801@gmx.de>
To: Bob MacGregor <macgregor@ISI.EDU>
Cc: Jeremy Carroll <jjc@hplb.hpl.hp.com>, Dan Brickley <danbri@w3.org>, www-rdf-interest@w3.org

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Bob MacGregor wrote:
| I didn't really have in mind an ordering, merely
| a distinction (two or more graphs, in any order).
| In logic, axioms (triples) have no order, and if
| possible, RDFisms should preserve that.

I understood Jeremy to mean, you need to somehow encode which of the
graphs is 'special' in that it is automatically asserted and tells you
which of the other graphs are; and to suggest that you could express
this in the serialization by taking the graph to be 'auto-asserted' that
comes first in the file.

I don't think Jeremy's saying that the order of the graphs be preserved
and have some meaning after deserialization; rather, the deserialized
information should consist of one asserted graph and a set of other,
not-auto-asserted graphs.

- - Benja
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (GNU/Linux)
Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org

iD8DBQFALAgsUvR5J6wSKPMRAnGnAJ9ypRYljA9fay3+plb1qoOYzXNmZQCdG2tB
hDRiryCECHpOCmaG9ZIBPik=
=au9+
-----END PGP SIGNATURE-----
Received on Thursday, 12 February 2004 18:11:43 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 5 February 2014 07:14:58 UTC