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.
Hi Emir.
On Wed, Nov 11, 2015 at 2:15 PM, Emir Muñoz wrote:
>
> I am interested in the project Marmotta, specially in the LDPath module. I
> would like
> to know if there are more
> documentation (besides the one online)
> or
> academic publications
> about the LDPath