- From: Dan Brickley <danbri@google.com>
- Date: Sun, 15 Sep 2013 20:27:41 +0100
- To: Sandro Hawke <sandro@w3.org>
- Cc: RDF-WG Group <public-rdf-wg@w3.org>
Received on Sunday, 15 September 2013 19:28:08 UTC
" Even though "1.0"^^xs:double "1.00"^^xs:double denote the same thing,
they are not the same RDF term, so the triple { :a :b 1.0 } is not the same
triple as { :a :b 1.00 }. Since they are not the same triple, the datasets
which say they are each what is contained by :g1 cannot both be true.
(See "Literal Term Equality" in RDF 1.1 Concepts.)"
Do you have a corresponding notion of exact graph matching that works with
bnodes too? Is it needed?
Does this intuitive 'contains' mean 'contains right now', 'contains last
time I looked', or something else?
Dan
Received on Sunday, 15 September 2013 19:28:08 UTC