论文标题
通过描述逻辑推理（扩展版本）来确定SHACL形状遏制
Deciding SHACL Shape Containment through Description Logics Reasoning (Extended Version)
论文作者
论文摘要
形状约束语言（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.
