Litte expressivity of Property Graphs compared to RDF Graphs due to lack of reification?

Question

Is there any way to represent this in a Property Graph:

"Peter likes Anna. This information was created by Dave. Dave is a Liar. The certainty of this information is 95%."

In a RDF Graph using Reification this could look like this:

There is no way of creating relations of relations in Property Graphs right? So how else can this be represented?

Answer 1

You can reify relationships as nodes. Here is a (rough) example:

(Peter:Person)-[:FEELS]->(f:Feeling {type:'likes'})-[:TOWARDS]->(Anna:Person)

(f)-[:CREATED_BY]->(Dave:Person)

(Dave)-[:HAS_PROPERTY]->(p:Property {type: 'is-a'})-[:WITH_VALUE]->(:PersonType {type:'liar'})

(p)-[:CERTAINTY]->(:Certainty {value: .95})