The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but did not consider the standard decision problems of satisfiability and containment, which are crucial for verifying the feasibility of the constraints and important for design and optimization purposes. In this paper, we undertake a thorough study of different features of non-recursive SHACL by providing a translation to a new first-order language, called SCL, that precisely captures the semantics of SHACL w.r.t. satisfiability and containment. We study the interaction of SHACL features in this logic and provide the detailed map of decidability and complexity results of the aforementioned decision problems for different SHACL sublanguages. Notably, we prove that both problems are undecidable for the full language, but we present decidable combinations of interesting features.

中文翻译：

---

SHACL 可满足性和包容性（扩展论文）

Shapes Constraint Language (SHACL) 是最近的 W3C 推荐语言，用于验证 RDF 数据。具体来说，SHACL 文档是在 RDF 图上强制执行特定形状的约束集合。先前关于该主题的工作为验证问题提供了理论和实践结果，但没有考虑可满足性和包含性的标准决策问题，这对于验证约束的可行性至关重要，对设计和优化目的很重要。在本文中，我们通过提供一种新的一阶语言（称为 SCL）的翻译，对非递归 SHACL 的不同特征进行了深入研究，该语言精确地捕获了 SHACL wrt 可满足性和包含性的语义。我们研究了该逻辑中 SHACL 特征的交互，并提供了上述决策问题的可判定性和复杂性结果的详细地图，适用于不同的 SHACL 子语言。值得注意的是，我们证明了这两个问题对于完整的语言都是不可判定的，但我们提出了有趣特征的可判定组合。