Abstract
The article presents shacl2sparql, a tool that validates an rdf graph stored as a sparql endpoint against possibly recursive shacl constraints. It is based on the algorithm proposed in [3]. This implementation improves upon the original algorithm with a wider range of natively supported constraint operators, sparql query optimization techniques, and a mechanism to explain invalid targets.