I was wondering if there was any support for traversing a link in the
reverse direction from a given node as part of a predicate tree.
Granted, this might not be so much of a tree anymore, but RDFa and
SPARQL property paths support such things. I was thinking the
something like the syntax in SPARQL property paths and N3 could be
reused - a ^ to indicate reverse direction.
http://www.w3.org/TR/sparql11-property-paths/#path-language
Do you think this is feasible? I've been using RDFa as a sort of
templating language, and so I wanted to parse the RDFa with missing
nodes and form a predicate tree to apply the graph pattern query
against a graph, though RDFa also has "rev" links in addition to
"rel"s.
-Leif Warner