DeepAI AI Chat
Log In Sign Up

SHACL Satisfiability and Containment (Extended Paper)

by   Paolo Pareti, et al.

The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but did not consider the standard decision problems of satisfiability and containment, which are crucial for verifying the feasibility of the constraints and important for design and optimization purposes. In this paper, we undertake a thorough study of different features of non-recursive SHACL by providing a translation to a new first-order language, called SCL, that precisely captures the semantics of SHACL w.r.t. satisfiability and containment. We study the interaction of SHACL features in this logic and provide the detailed map of decidability and complexity results of the aforementioned decision problems for different SHACL sublanguages. Notably, we prove that both problems are undecidable for the full language, but we present decidable combinations of interesting features.


Satisfiability and Containment of Recursive SHACL

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

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

We present an introduction and a review of the Shapes Constraint Languag...

The Complexity of Reasoning with FODD and GFODD

Recent work introduced Generalized First Order Decision Diagrams (GFODD)...

Quine's Fluted Fragment Revisited

We study the fluted fragment, a decidable fragment of first-order logic ...

ExpTime Tableaux for Type PDL

The system of Type PDL (τPDL) is an extension of Propositional Dynamic L...

On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic

This paper investigates the satisfiability problem for Separation Logic,...