DeepAI AI Chat
Log In Sign Up

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

by   Paolo Pareti, et al.

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.


page 1

page 2

page 3

page 4


SHACL Satisfiability and Containment (Extended Paper)

The Shapes Constraint Language (SHACL) is a recent W3C recommendation la...

Satisfiability and Containment of Recursive SHACL

The Shapes Constraint Language (SHACL) is the recent W3C recommendation ...

SHACL Constraints with Inference Rules

The Shapes Constraint Language (SHACL) has been recently introduced as a...

Narrowing Down XML Template Expansion and Schema Validation

This work examines how much template instantiation can narrow down schem...

Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints

Simple conceptual graphs are considered as the kernel of most knowledge ...

Recursion in RDF Data Shape Languages

An RDF data shape is a description of the expected contents of an RDF do...