将OWL知识内化到SHACL约束中，一次重写即可跨平台验证。
Rewrite Once, Validate Anywhere: Producing OWL-Aware SHACL Constraints (Extended Version)
- 将OWL EL⁻本体的语义规则转化为SHACL约束，实现知识内联。
- 在基准测试中，发现违规效率高于传统分步推理验证流程。
- 适合需要统一验证且不依赖复杂推理引擎的RDF数据应用者。
形状约束语言（SHACL）是用于表达RDF图上语法约束的标准。传统方法需先进行推理，再用验证器检查结果，常因技术分离导致效率低、易出错。本文提出将OWL EL⁻本体中的公理内化至SHACL约束中：输入为形状与一个限制存在量词使用的OWL EL⁻本体，输出可由任意支持核心SHACL的验证器评估，无需额外推理。实验表明，该方法在发现违反约束方面普遍比串行处理更高效，提供了一种简化推理与验证融合的有力工具。
原文摘要 · Abstract (English)
The Shapes Constraint Language (SHACL) is a W3C recommendation to express syntactic constraints, called shapes, on RDF graphs. SHACL validators are used to test whether a given graph adheres to such a shape. However, RDF graphs often come with OWL ontologies, whose implicit knowledge needs to be taken into account. This is classically handled by first applying reasoning and then performing the constraint checking on the results, often using different technologies which makes the process inefficient and vulnerable for mistakes. To overcome this, we propose to internalise the OWL axioms in the SHACL constraints; we construct a rewriting which takes as input both shapes and an OWL EL$^-$ ontology -- a fragment of OWL EL restricting the usage of existential restrictions -- and produces SHACL constraints. This output can then be evaluated by any validator supporting SHACL core regardless of its reasoning support, while yielding the same results as the traditional approach. The implementation of our translation is evaluated both against applying state-of-the-art reasoners and validators consecutively, as against validators with built-in reasoning support. For our benchmark, we show that our approach is in general more efficient in finding violations compared to the sequential approach, thus providing a powerful tool which simplifies combining reasoning with validation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。