论文标题
SHACL功能和扩展的表现力，以进行完全平等和不相交测试
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
论文作者
论文摘要
SHACL是一种用于W3C的模式语言，用于在RDF图上表达结构性约束。对这种语言进行形式化的最新工作揭示了与描述逻辑的惊人关系。 SHACL表达式可以使用三个在说明逻辑中并不常见的基本功能。这些功能是平等测试；脱节测试；和闭合约束。此外，SHACL在包含约束的左侧仅允许允许限制的表达式（所谓目标）形式特有。 本文的目的是清楚地了解这些特征和限制的影响和表现力。我们表明，这四个功能中的每个功能都是原始的：使用该功能，可以表达不使用该功能的不可表达的布尔查询。我们还表明，只要不使用闭合约束，SHACL对允许的目标施加的限制是不必要的。 此外，我们表明，用“完整”的平等测试或不相交测试来丰富SHACL会导致严格强大的语言。
SHACL is a W3C-proposed schema language for expressing structural constraints on RDF graphs. Recent work on formalizing this language has revealed a striking relationship to description logics. SHACL expressions can use three fundamental features that are not so common in description logics. These features are equality tests; disjointness tests; and closure constraints. Moreover, SHACL is peculiar in allowing only a restricted form of expressions (so-called targets) on the left-hand side of inclusion constraints. The goal of this paper is to obtain a clear picture of the impact and expressiveness of these features and restrictions. We show that each of the four features is primitive: using the feature, one can express boolean queries that are not expressible without using the feature. We also show that the restriction that SHACL imposes on allowed targets is inessential, as long as closure constraints are not used. In addition, we show that enriching SHACL with "full" versions of equality tests, or disjointness tests, results in a strictly more powerful language.
