Closed smokkapa closed 4 months ago
Given that there can be an infinite number of properties, you cannot use a path expression such as rdf:_1 | rdf:_2 | ...
So I guess your best bet would be SHACL-SPARQL, where you can treat the predicate as an unbound variable.
I see. Will try it out. Thanks!
If the base system supports rdfs:member
, which is the super-property of all rdf:_N
, then that might provide a solution.
In preparation for a potential future SHACL WG I would like to close GitHub issues that were mainly just questions. Please reopen if you disagree.
I am currently trying to build a constraint validation shape for an incoming object of the type rdf:Seq. In, rdf:Seq the predicate is a variable, as it can be rdf:_1, rdf:_2,...., where the numbers indicate the ordinality of the object in the list . How can I build a property shape to validate the data coming in rdf:Seq?
Appreciate any help. Thanks!
Let's say for a given incoming data
What could the shape be? Can something like the following is possible?