paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic

判定一阶模态逻辑中插值式与定义的存在性
LMCS vol.Volume 21, Issue 42025匹配度 1/10 · 该论文研究一阶模态逻辑中插值式与定义存在性的可判定性与复杂度,属于纯逻辑/自动机理论,未涉及静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析等用户核心方向。虽与形式化方法有微弱关联,但距离研究画像中的 PL 与 AI 交叉问题很远。引用 5 inbox
Agi Kurucz, Frank Wolter, Michael Zakharyaschev
crossref: 2026-09-10

AI 速览

一句话:确定一阶模态逻辑中插值式与定义存在性在若干片段上的可判定性与复杂度。

常域语义下,K 与 S5 之间的一阶模态逻辑即使限制为单个体变元也不具备 Craig 插值或投影 Beth 可定义性,故插值式/定义存在性不能归约为有效性。本文研究这些存在性问题的可判定性与复杂度:在 S5 的可判定片段 Q^1S5 及 S5 与带 universal role 的 ALC 结合片段 S5_ALC^u 中,插值式和定义存在性为 coN2ExpTime 可判定、2ExpTime-hard,uniform interpolant existence 不可判定,并迁移到无等词 FO^2;在 K 的一变量片段 Q^1K 中为非初等可判定,uniform interpolant existence 仍不可判定。

问题
研究一阶模态逻辑及相关描述逻辑片段中 Craig 插值式和显式定义存在性问题的可判定性与计算复杂度;这些逻辑不具插值和 Beth 可定义性,因此无法直接归约到有效性。
方法
分别考察 S5 的可判定片段 Q^1S5、S5_ALC^u 以及 K 的一变量片段 Q^1K,证明插值式与定义存在性的判定性、复杂度上下界,并将部分结果迁移到 FO^2。
评估
以理论结果评估:给出 coN2ExpTime 可判定与 2ExpTime-hard、非初等可判定等复杂度分类,并证明 uniform interpolant existence 不可判定。
原文摘要(Abstract)

None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It follows that the existence of a Craig interpolant for a given implication or of an explicit definition for a given predicate cannot be directly reduced to validity as in classical first-order and many other logics. Our concern here is the decidability and computational complexity of the interpolant and definition existence problems. We first consider two decidable fragments of first-order modal logic $\mathsf{S5}$: the one-variable fragment $\mathsf{Q^1S5}$ and its extension $\mathsf{S5}_{\mathcal{ALC}^u}$ that combines $\mathsf{S5}$ and the description logic$\mathcal{ALC}$ with the universal role. We prove that interpolant and definition existence in $\mathsf{Q^1S5}$ and $\mathsf{S5}_{\mathcal{ALC}^u}$ is decidable in coN2ExpTime, being 2ExpTime-hard, while uniform interpolant existence is undecidable. These results transfer to the two-variable fragment $\mathsf{FO^2}$ of classical first-order logic without equality. We also show that interpolant and definition existence in the one-variable fragment $\mathsf{Q^1K}$ of first-order modal logic $\mathsf{K}$ is non-elementary decidable, while uniform interpolant existence is again undecidable.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@article{KuruczWZ25,
  title = {Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic},
  author = {Agi Kurucz and Frank Wolter and Michael Zakharyaschev},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 21, Issue 4},
  year = {2025},
  doi = {10.46298/lmcs-21(4:6)2025}
}