SHACL可满足性和包容性(扩展文件)
SHACL Satisfiability and Containment (Extended Paper)
摘要:
XML约束语言(SHACL)是最近W3C推荐的用于验证RDF数据的语言。具体来说,SHACL文档是在RDF图上强制特定形状的约束的集合。以前的工作提供了理论和实际的验证问题的结果,但没有考虑标准的决策问题的可满足性和包容性,这是至关重要的验证的可行性的约束和重要的设计和优化的目的。在本文中,我们进行了深入的研究,非递归SHACL的不同功能,提供了一个新的一阶语言,称为SCL的翻译,准确地捕捉语义的SHACL w.r.t.可满足性和包容性。我们研究了SHACL功能在这个逻辑中的相互作用,并提供了详细的地图的可判定性和复杂性的结果,上述决策问题的不同SHACL子语言。值得注意的是,我们证明了这两个问题是不可判定的完整的语言,但我们提出了可判定的组合有趣的功能。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。