递归SHACL的不动点语义
Fixpoint Semantics for Recursive SHACL
摘要:
SHACL是W3C提出的一种语言,用于表达RDF图上的结构约束。该建议仅指定了非递归SHACL的语义;最近,已经做出了一些努力来允许递归SHACL模式。在本文中,我们认为,定义和研究递归SHACL的语义,可以从多年的非单调推理的研究中吸取教训。我们表明,从SHACL模式,可以直接获得一个三值语义算子。基于近似不动点理论(AFT),该运算符立即归纳出各种各样的语义,包括支持的、稳定的和有根据的语义,以预期的方式相关。通过建立在AFT上,丰富的理论结果可以直接用于SHACL。因此,这篇短文的主要贡献是为递归SHACL的研究提供理论基础,这可以在以后为W3C推荐的扩展做出明智的决定。
英文摘要:
SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. The recommendation only specifies semantics for non-recursive SHACL; recently, some efforts have been made to allow recursive SHACL schemas. In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning. We show that from a SHACL schema, a three-valued semantic operator can directly be obtained. Building on Approximation Fixpoint Theory (AFT), this operator immediately induces a wide variety of semantics, including a supported, stable, and well-founded semantics, related in the expected ways. By building on AFT, a rich body of theoretical results becomes directly available for SHACL. As such, the main contribution of this short paper is providing theoretical foundations for the study of recursive SHACL, which can later enable an informed decision for an extension of the W3C recommendation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。