W3C home > Mailing lists > Public > www-rdf-logic@w3.org > July 2003

RE: Blank Node Equality Question

From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
Date: Mon, 21 Jul 2003 10:53:57 +0200
To: <jimbobbs@hotmail.com>, <www-rdf-logic@w3.org>
Message-ID: <BHEGLCKMOHGLGNOKPGHDMENACBAA.jjc@hpl.hp.com>


I believe so.

If the nodes are _:a and _:b
If we have a proof:

G
|-
t   (where t is a triple containing _:a)

then we can lexically swap _:a and _:b in the proof to get a new proof of t'
which contains _:b instead of _:a.

Jeremy


(Note that the hypothesis graph means exactly the same as one in which one
of the two nodes is excised completely)


> -----Original Message-----
> From: www-rdf-logic-request@w3.org
> [mailto:www-rdf-logic-request@w3.org]On Behalf Of Jimmy
> Sent: 21 July 2003 03:02
> To: www-rdf-logic@w3.org
> Subject: Blank Node Equality Question
>
>
>
> If I have two blank nodes - each connected to identical nodes via
> identical predicates - then do the two nodes share the same properties?
> I.E.  Any inferences made about one node are true for the other node.
>
> --
> Jimmy Cerra
>
> ] "A good decision is based on knowledge
> ]  and not on numbers" - Plato
>
>
>
Received on Monday, 21 July 2003 04:55:49 GMT

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