- From: Miles, AJ (Alistair) <A.J.Miles@rl.ac.uk>
- Date: Wed, 29 Oct 2003 17:25:33 -0000
- To: "Dave Beckett (E-mail)" <dave.beckett@bristol.ac.uk>, "Dan Brickley (E-mail)" <danbri@w3.org>
- Cc: "'public-esw-thes@w3.org'" <public-esw-thes@w3.org>
I found this in the Concepts and Abstract Syntax doc: 6.6 Blank Nodes The blank nodes in an RDF graph are drawn from an infinite set. This set of blank nodes, the set of all RDF URI references <http://www.w3.org/TR/rdf-concepts/#dfn-URI-reference> and the set of all literals <http://www.w3.org/TR/rdf-concepts/#dfn-literal> are pairwise disjoint. Otherwise, this set of blank nodes is arbitrary. RDF makes no reference to any internal structure of blank nodes. Given two blank nodes, it is possible to determine whether or not they are the same. How is it determined whether or not two blank nodes are the same? Al. CCLRC - Rutherford Appleton Laboratory Building R1 Room 1.60 Fermi Avenue Chilton Didcot Oxfordshire OX11 0QX United Kingdom Email: a.j.miles@rl.ac.uk Telephone: +44 (0)1235 445440
Received on Wednesday, 29 October 2003 12:25:35 UTC