# RE: Blank Node Equality Question

From: Graham Klyne <GK@ninebynine.org>
Date: Mon, 21 Jul 2003 10:11:14 +0100
Message-Id: <5.1.0.14.2.20030721100947.01f2aea0@127.0.0.1>
To: "Jeremy Carroll" <jjc@hplb.hpl.hp.com>, <jimbobbs@hotmail.com>, <www-rdf-logic@w3.org>
```
Er, I don't think that follows... yes, on the information provided you can
prove the same thing(s) about _:a and _:b, but that doesn't necessarily
mean they're the same thing.

#g
--

At 10:53 21/07/03 +0200, Jeremy Carroll wrote:

>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
> >
> >
> >

-------------------
Graham Klyne
<GK@NineByNine.org>
PGP: 0FAA 69FF C083 000B A2E9  A131 01B9 1C7A DBCA CB5E
```
Received on Monday, 21 July 2003 05:17:08 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 2 March 2016 11:10:40 UTC