Fixpoint Semantics for Recursive SHACL

Bart Bogaerts, Maxime Jakubowski

Onderzoeksoutput: Conference paper

3 Downloads (Pure)


SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. The recommendation only specifies semantics for non-recursive SHACL; recently, some efforts have been made to allow recursive SHACL schemas. In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning. We show that from a SHACL schema, a three-valued semantic operator can directly be obtained. Building on Approximation Fixpoint Theory (AFT), this operator immediately induces a wide variety of semantics, including a supported, stable, and well-founded semantics, related in the expected ways. By building on AFT, a rich body of theoretical results becomes directly available for SHACL. As such, the main contribution of this short paper is providing theoretical foundations for the study of recursive SHACL, which can later enable an informed decision for an extension of the W3C recommendation.

Originele taal-2English
TitelProceedings 37th International Conference on Logic Programming (Technical Communications)
UitgeverijOpen Publishing Association
Aantal pagina's7
StatusPublished - 17 sep 2021
Evenement37th International Conference on Logic Programming - Porto, Porto, Portugal
Duur: 20 sep 202127 sep 2021
Congresnummer: 37

Publicatie series

NaamElectronic Proceedings in Computer Science
UitgeverijOpen Publishing Association
ISSN van geprinte versie2075-2180
ISSN van elektronische versie2075-2180


Conference37th International Conference on Logic Programming
Verkorte titelICLP


Duik in de onderzoeksthema's van 'Fixpoint Semantics for Recursive SHACL'. Samen vormen ze een unieke vingerafdruk.

Citeer dit