Reproduce “Trav-SHACL: Efficiently Validating Networks of SHACL Constraints” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Mónica Figuera, Philipp D. Rohde, Maria-Esther Vidal

Trav-SHACL validates linked RDF entities against SHACL constraints by ordering shapes and rewriting queries using entities already classified. It combines answers with rule inference, skipping checks that depend on failed entities. On LUBM-generated graphs, it achieved up to 28.93× faster wall-clock validation than Java SHACL2SPARQL for large-graph Shape Schema 1, but SHACL2SPARQL was 1.18× faster for small-graph Schema 2.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.