I'm interested in the following things about LDPath: 1) formal grammar of LDPath 2) how the language deals with blank nodes? (and how it defines reachability in that case) 3) definition of paths similarity
I understand LDPath is not a tree language, i.e., you cannot access parents or siblings. Could be that possible with an extension or it needs a complete re-definition? Hope some of the guys could give me some insights on my questions. Best, Emir
