Expressiveness of SHACL Features

Bart Bogaerts, Maxime Jakubowski, Jan Van Den Bussche

Onderzoeksoutput: Conference paper

1 Citaat (Scopus)
23 Downloads (Pure)


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.

Originele taal-2English
Titel25th International Conference on Database Theory (ICDT 2022)
RedacteurenDan Olteanu, Nils Vortmeier
UitgeverijSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Aantal pagina's16
ISBN van elektronische versie978-3-95977-223-5
ISBN van geprinte versie978-3-95977-223-5
StatusPublished - 1 mrt 2022
Evenement25th International Conference on Database Theory (ICDT 2022) -
Duur: 29 mrt 20221 apr 2022

Publicatie series

NaamLeibniz International Proceedings in Informatics (LIPIcs)
UitgeverijSchloss Dagstuhl -- Leibniz-Zentrum für Informatik
ISSN van geprinte versie1868-8969
ISSN van elektronische versie1868-8969


Conference25th International Conference on Database Theory (ICDT 2022)

Citeer dit