RDF supports "blank nodes" for this use case. These are URI-less nodes that can only be referenced within the graph where they're defined. You'd use URI for reference to outside entities, which can be very relevant even in a private knowledge store.
RDF supports "blank nodes" for this use case. These are URI-less nodes that can only be referenced within the graph where they're defined. You'd use URI for reference to outside entities, which can be very relevant even in a private knowledge store.
The fact that they don't have a reified instance means that they are open to collapse with other blank nodes in certain inference scenarios and makes a lot of problems as hard as graph isomorphism.
Much better to go with plain old UUIDs instead.
The problem with blank nodes is that they circumvent the UNA in every scenario, and you need something like "reified blank nodes" to resolve this, a.k.a. by using UUIDs treated as blank nodes.
See the following paper for a more in-depth discussion on the topic https://aidanhogan.com/docs/blank_nodes_jws.pdf