提出链分层机制，解决RDF规则中否定语义的歧义问题。
Stratified Negation in RDF Rules: A Correct Approach (Extended Version)
- 基于多步推导分析与约束过滤，设计链分层条件
- 任意遵守该条件的规则顺序均生成唯一、简洁的图结果
- 适用于含存在量词的RDF规则，适合知识图谱推理场景
将RDF规则语言（如N3或SHACL Rules）与默认否定结合面临挑战。现有分层方法在RDF规则中常失效，因单个三元组信息不足，难以有效限制潜在依赖关系。规则头中的空白节点更使问题复杂化：规则应用顺序可能决定新值是否生成，进而影响含否定规则的适用性。为解决此问题，我们提出链分层这一稳健的新条件，确保含否定的RDF规则及一般存在规则具有良好的语义。该条件结合对多步推导的精细分析与完整性约束以排除不可能情形。只要规则应用顺序满足链分层，即可保证推导出唯一、精简且符合否定失败语义的RDF图。我们还提供了原型实现以验证实用性。
原文摘要 · Abstract (English)
Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may determine whether new values are created, which in turn can change the applicability of rules with negation. To solve these open problems, we propose chain stratification as a robust new condition that guarantees a well-behaved semantics for RDF rules with negation, and existential rules in general. Our condition combines an elaborate analysis of potential multistep derivations with a mechanism for using integrity constraints to discard impossible cases. Applying rules in any order that respects chain stratification is guaranteed to derive an RDF graph that is unique, lean, and justified under the usual negation-as-failure semantics. To show the practicality, we also provide a prototype implementation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。