研究图数据更新后约束验证，确保数据一致性。
SHACL Validation under Graph Updates (Extended Paper)
- 将更新操作嵌入SHACL约束，用逻辑归约解决验证问题。
- 证明静态验证在特定片段中可判定，复杂度可分析。
- 适合构建动态知识图谱的可靠性保障系统。
SHACL（SHApe Constraint Language）是用于RDF图的W3C标准约束语言。本文研究在图更新下对RDF图进行SHACL验证的问题。我们提出一种基于SHACL的更新语言，能刻画直观且现实的RDF图修改行为，并研究此类更新下的静态验证问题：即验证任一满足给定SHACL规范的图，在执行指定更新序列后是否仍满足该规范。这一问题为推理演化中的RDF图提供了基础。通过将更新操作嵌入到SHACL约束中的回归技术，我们证明静态验证可归约为（扩展后的）SHACL约束的（不可）满足性。我们分析了SHACL及其关键片段在该问题上的计算复杂性。最后，我们实现了一个原型系统，支持在SHACL约束上进行静态验证与其他静态分析任务，并通过初步实验展示了其行为。
原文摘要 · Abstract (English)
SHACL (SHApe Constraint Language) is a W3C standardized constraint language for RDF graphs. In this paper, we study SHACL validation in RDF graphs under updates. We present a SHACL-based update language that can capture intuitive and realistic modifications on RDF graphs and study the problem of static validation under such updates. This problem asks to verify whether every graph that validates a SHACL specification will still do so after applying a given update sequence. More importantly, it provides a basis for further services for reasoning about evolving RDF graphs. Using a regression technique that embeds the update actions into SHACL constraints, we show that static validation under updates can be reduced to (un)satisfiability of constraints in (a minor extension of) SHACL. We analyze the computational complexity of the static validation problem for SHACL and some key fragments. Finally, we present a prototype implementation that performs static validation and other static analysis tasks on SHACL constraints and demonstrate its behavior through preliminary experiments.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。