提出可表达多视角非单调推理的S4F立场逻辑，计算复杂度不高于原逻辑。
Non-Monotonic S4F Standpoint Logic (Extended Version with Proofs)
- 融合S4F与立场逻辑，支持多视角非单调推理
- 证明其计算复杂度与基础逻辑相当
- 适合研究信念整合与多智能体推理的学者
立场逻辑为表示多种异构观点提供了统一的基于模态逻辑的形式化框架。同时，许多非单调推理框架可通过模态逻辑（尤其是S4F）自然建模。本文提出一种新形式化体系——S4F立场逻辑，它同时推广了S4F和立场命题逻辑，因而能够表达多视角、非单调的语义承诺。我们定义了其语法与语义，并分析其计算复杂性，结果表明：无论在单调还是非单调形式下，该逻辑的计算复杂度均不高于其组成部分。我们还阐述了共识性与怀疑性接受机制，并通过实例展示该框架的应用。
原文摘要 · Abstract (English)
Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the modal logic S4F. In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and standpoint propositional logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。