论文标题
通过递归的模态逻辑翻译复杂性
Complexity through Translations for Modal Logic with Recursion
论文作者
论文摘要
本文使用翻译来研究经典模态逻辑及其与定点操作员扩展的复杂性，并使用翻译来传递跨逻辑的结果。特别是，我们通过与MU-Calculus和模态逻辑的翻译显示了多代理逻辑的几个复杂性结果，这使我们能够传输已知的上限和下限。我们还使用这些翻译来基于Kozen的Mu-Calculus的Tableau，以及用于模态逻辑的Fitting和Massacci之一，为我们研究的逻辑引入终止图表系统。
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations to and from the mu-calculus and modal logic, which allow us to transfer known upper and lower bounds. We also use these translations to introduce a terminating tableau system for the logics we study, based on Kozen's tableau for the mu-calculus, and the one of Fitting and Massacci for modal logic.
