Oudshoorn, A. M. (2025). SHACL Satisfiability: What Can We Learn from DLs? In L. Tendera, Y. A. Ibanez Garcia, & P. Koopmann (Eds.), Proceedings of the 38th International Workshop on Description Logics - DL 2025. ceur.
E192-03 - Forschungsbereich Knowledge Based Systems E056-13 - Fachbereich LogiCS
-
Published in:
Proceedings of the 38th International Workshop on Description Logics - DL 2025
-
Volume:
4091
-
Date (published):
2025
-
Event name:
38th International Workshop on Description Logics - DL 2025
en
Event date:
3-Sep-2025 - 6-Sep-2025
-
Event place:
Opole, Poland
-
Number of Pages:
12
-
Publisher:
ceur
-
Peer reviewed:
Yes
-
Keywords:
SHACL; satisfiability; finite-model property
en
Abstract:
Since the introduction of the SHACL standard, understanding its computational features and formal foundations
has become essential. Some research has focused on the semantics of recursive constraints and the complexity of
validation, but the satisfiability of SHACL constraints remains largely unexplored. The most significant previous
work in this direction is rather coarse, obtaining very few positive results for finite satisfiability and for fragments
with counting. In this paper, we build on description logics to paint a comprehensive and fine-grained boundary
for SHACL fragments with a decidable satisfiability problem under the supported semantics, both for unrestricted
and finite models.
