RE: Blank Node Equality Question

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 UTC