A review of SHACL: from data validation to schema reasoning for RDF graphs
From MaRDI portal
Publication:6166580
DOI10.1007/978-3-030-95481-9_6zbMATH Open1524.68117arXiv2112.01441OpenAlexW3217398853MaRDI QIDQ6166580FDOQ6166580
Authors: Paolo Pareti, George Konstantinidis
Publication date: 3 August 2023
Published in: Reasoning Web. Declarative Artificial Intelligence (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/2112.01441
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15) Internet topics (68M11)
Cites Work
Cited In (2)
This page was built for publication: A review of SHACL: from data validation to schema reasoning for RDF graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166580)