Expressiveness of SHACL Features

Bart Bogaerts, Maxime Jakubowski, Jan Van Den Bussche

Research output: Chapter in Book/Report/Conference proceedingConference paper

1 Downloads (Pure)

Abstract

SHACL is a W3C-proposed schema language for expressing structural constraints on RDF graphs. Recent work on formalizing this language has revealed a striking relationship to description logics. SHACL expressions can use four fundamental features that are not so common in description logics. These features are zero-or-one path expressions; equality tests; disjointness tests; and closure constraints. Moreover, SHACL is peculiar in allowing only a restricted form of expressions (so-called targets) on the left-hand side of inclusion constraints. The goal of this paper is to obtain a clear picture of the impact and expressiveness of these features and restrictions. We show that each of the four features is primitive: using the feature, one can express boolean queries that are not expressible without using the feature. We also show that the restriction that SHACL imposes on allowed targets is inessential, as long as closure constraints are not used.

Original languageEnglish
Title of host publication25th International Conference on Database Theory (ICDT 2022)
EditorsDan Olteanu, Nils Vortmeier
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages15:1-15:16
Number of pages16
Volume220
ISBN (Electronic)978-3-95977-223-5
ISBN (Print)978-3-95977-223-5
DOIs
Publication statusPublished - 1 Mar 2022
Event25th International Conference on Database Theory (ICDT 2022) -
Duration: 29 Mar 20221 Apr 2022

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl -- Leibniz-Zentrum für Informatik
Volume220
ISSN (Print)1868-8969
ISSN (Electronic)1868-8969

Conference

Conference25th International Conference on Database Theory (ICDT 2022)
Period29/03/221/04/22

Cite this