统一逻辑编程与论证框架的强等价性，解决动态更新下的语义不一致问题。
On Strong Equivalence Notions in Logic Programming and Abstract Argumentation
- 提出逻辑程序的新强等价定义，兼容静态与动态场景。
- 证明该定义在特定类逻辑程序与两种论证框架间保持等价性。
- 适合研究非单调逻辑、论证理论或形式化知识库的学者参考。
知识库间的强等价性确保在任何上下文中均可相互替换而不影响推理结果，是非单调形式化系统中的关键性质。逻辑编程与抽象论证框架是此类性质研究的主要领域，尽管两者在静态设定下语义等价，但在动态更新场景中因更新机制不同而失去对齐。本文深入分析这一差异，提出逻辑程序的新强等价概念，使特定类逻辑程序与Dung风格及主张增强型论证框架之间的翻译保持强等价性，从而恢复两类形式系统的兼容性。
原文摘要 · Abstract (English)
Strong equivalence between knowledge bases ensures the possibility of replacing one with the other without affecting reasoning outcomes, in any given context. This makes it a crucial property in nonmonotonic formalisms. In particular, the fields of logic programming and abstract argumentation provide primary examples in which this property has been subject to vast investigations. However, while (classes of) logic programs and abstract argumentation frameworks are known to be semantically equivalent in static settings, this alignment breaks in dynamic contexts due to differing notions of update. As a result, strong equivalence does not always carry over from one formalism to the other. In this paper, we carefully investigate this discrepancy and introduce a new notion of strong equivalence for logic programs. Our approach preserves strong equivalence under translation between certain classes of logic programs and both Dung-style and claim-augmented argumentation frameworks, thus restoring compatibility across these formalisms.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。