SHACL: A Description Logic in Disguise
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche

TL;DR
This paper demonstrates that SHACL, a language for RDF graph constraints, is fundamentally a description logic, establishing a formal foundation for its use in the semantic web.
Contribution
It provides a formal proof that SHACL is a description logic, clarifying its relation to OWL and the foundations of semantic web technologies.
Findings
SHACL is formally equivalent to a description logic.
Establishes SHACL's place within the formal foundations of semantic web.
Clarifies the relationship between SHACL, OWL, and description logics.
Abstract
SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. In recent years, SHACL's popularity has risen quickly. This rise in popularity comes with questions related to its place in the semantic web, particularly about its relation to OWL (the de facto standard for expressing ontological information on the web) and description logics (which form the formal foundations of OWL). We answer these questions by arguing that SHACL is in fact a description logic. On the one hand, our answer is surprisingly simple, some might even say obvious. But, on the hand, our answer is also controversial. By resolving this issue once and for all, we establish the field of description logics as the solid formal foundations of SHACL.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
