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

Re: N-Triples: Naming anonnodes

From: Brian McBride <bwm@hplb.hpl.hp.com>
Date: Mon, 23 Jul 2001 23:19:09 +0100
Message-ID: <3B5CA2DD.48D0684A@hplb.hpl.hp.com>
To: Graham Klyne <Graham.Klyne@Baltimore.com>
CC: Aaron Swartz <me@aaronsw.com>, w3c-rdfcore-wg@w3.org

Graham Klyne wrote:

> I don't think it's a reasonable goal that a (simple) parser will generate
> identical N-triples for equivalent graphs.  I think it's enough that the
> structures generated do not impede the design/application of an algorithm
> to determine graph equivalence.

I was not suggesting otherwise.

> [...]
> >If so, we are back into the complexities of graph theory.
> I don't think we ever seriously got away from them if we want to evaluate
> graph-equivalence.

Just so.

Received on Monday, 23 July 2001 18:22:14 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:53:50 UTC