Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Comparative expressiveness of ShEx and SHACL (Early working draft)

Iovka Boneva 1
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : Contributions • We propose a simple formal language for graph shapes that subsumes both ShEx and SHACL. The semantics of the language is based on the semantics of Datalog, and also equivalently defined in terms of Monadic Second Order Logic with Presburger constraints. • We propose a formal semantics of SHACL as a translation to this language. Thanks to this translation, we show that SHACL can be extended with well-defined stratified recursion. • We show how ShEx can be translated to this language. • We explore the necessary restrictions on ShEx so that it can be translated to SHACL, and also the possible modifications of SHACL so that it can capture a bigger fragment of ShEx.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Iovka Boneva Connect in order to contact the contributor
Submitted on : Monday, March 14, 2016 - 6:14:31 PM
Last modification on : Friday, December 11, 2020 - 6:44:06 PM
Long-term archiving on: : Wednesday, June 15, 2016 - 3:30:36 PM


Files produced by the author(s)




  • HAL Id : hal-01288285, version 1



Iovka Boneva. Comparative expressiveness of ShEx and SHACL (Early working draft). 2016. ⟨hal-01288285⟩



Record views


Files downloads