arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.13603cs.LO
收藏

通过描述逻辑推理确定SHACL形状包容性(扩展版)

Deciding SHACL Shape Containment through Description Logics Reasoning (Extended Version)

Martin Leinberger, Philipp Seifer, Tjitze Rienstra, Ralf Lämmel, Steffen Staab

摘要:

XML约束语言(SHACL)允许对RDF数据图进行形式化约束。形状将RDF图中的节点可以满足的一组约束分组。我们调查的问题之间的SHACL形状的包容性。如果满足第一形状的约束的每个图节点也满足第二形状的约束,则一个形状包含在第二形状中。为了判定形状包容性,我们将SHACL形状图映射到描述逻辑公理中,使得形状包容性可以通过描述逻辑推理来回答。我们确定了几个,越来越严格的语法限制SHACL,这种方法变得健全和完整。

英文摘要:

The Shapes Constraint Language (SHACL) allows for formalizing constraints over RDF data graphs. A shape groups a set of constraints that may be fulfilled by nodes in the RDF graph. We investigate the problem of containment between SHACL shapes. One shape is contained in a second shape if every graph node meeting the constraints of the first shape also meets the constraints of the second. To decide shape containment, we map SHACL shape graphs into description logic axioms such that shape containment can be answered by description logic reasoning. We identify several, increasingly tight syntactic restrictions of SHACL for which this approach becomes sound and complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑