W3C home > Mailing lists > Public > semantic-web@w3.org > December 2018

Re: Pragmatics of Blank Nodes Re: Toward easier RDF: a proposal

From: David Booth <david@dbooth.org>
Date: Tue, 4 Dec 2018 23:11:21 -0500
To: semantic-web <semantic-web@w3.org>, Anthony Moretti <anthony.moretti@gmail.com>, Pat Hayes <phayes@ihmc.us>
Message-ID: <ba5c2c1a-6284-8615-53f9-77704e8bb922@dbooth.org>
 >> On Tue, Dec 4, 2018 at 5:42 PM Patrick J Hayes wrote:
 >> How can you ever know that the particular arguments given to
 >> the n-ary relation are enough to constitute a key?

I'm not sure that "key" is quite the right term here, though
perhaps it amounts to a key of sorts, because the connected
properties uniquely "identify" a lean version of that blank
node.  I think.  I'm still trying to get my head around this!

 >> And if you do know it, how can you state it so as to validate
 >> the inference? I don't think (?) it can be stated in, for
 >> example, OWL. You would need at least FOL with identity,
 >> way beyond RDF expressivity.
 > On 12/4/18 8:51 PM, Anthony Moretti wrote:
 > It think it's the same as the discussion around Addresses,
 > it just depends from type to type what constitutes a key.

I don't think so.  I think it is much simpler than that.  If I
have understood it correctly, it is a consequence of
"lean"ing the graph.

David Booth
Received on Wednesday, 5 December 2018 04:11:43 UTC

This archive was generated by hypermail 2.4.0 : Tuesday, 5 July 2022 08:45:57 UTC