mlsanityData to 7 Oct 2026

A Review of SHACL: From Data Validation to Schema Reasoning for RDF Graphs

arXiv 2112.01441 ↗First posted 2 Dec 2021cs.AI cs.DBcited by 7

Not on the map. Why?

Abstract (arXiv)

We present an introduction and a review of the Shapes Constraint Language (SHACL), the W3C recommendation language for validating RDF data. A SHACL document describes a set of constraints on RDF nodes, and a graph is valid with respect to the document if its nodes satisfy these constraints. We revisit the basic concepts of the language, its constructs and components and their interaction. We review the different formal frameworks used to study this language and the different semantics proposed. We examine a number of related problems, from containment and satisfiability to the interaction of SHACL with inference rules, and exhibit how different modellings of the language are useful for different problems. We also cover practical aspects of SHACL, discussing its implementations and state of adoption, to present a holistic review useful to practitioners and theoreticians alike.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 5 of its 57 references that are in the map. First posted on arXiv 2 Dec 2021.

Builds on

5 of 57 references.

References · 5

  1. 2020Deciding SHACL Shape Containment through Description Logics Reasoning (Extended Version)cited by 7
  2. 2019SHACL Constraints with Inference Rulescited by 5
  3. 2021Trav-SHACL: Efficiently Validating Networks of SHACL Constraintscited by 4
  4. 2021Satisfiability and Containment of Recursive SHACLcited by 4
  5. 2018Finite Satisfiability of Unary Negation Fragment with Transitivitycited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 3; 2026: 1.

7 papers.