Complexity through Translations for Modal Logic with Recursion

被引:1
|
作者
Aceto, Luca [1 ,2 ]
Achilleos, Antonis [1 ]
Anastasiadi, Elli [1 ]
Francalanza, Adrian [3 ]
Ingolfsdottir, Anna [1 ]
机构
[1] Reykjavik Univ, Dept Comp Sci, Reykjavik, Iceland
[2] Gran Sasso Sci Inst, Laquila, Italy
[3] Univ Malta, Dept Comp Sci, ICT, Msida, Malta
关键词
MU-CALCULUS; HIERARCHY; INFINITE;
D O I
10.4204/EPTCS.370.3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper studies the complexity of classical modal logics , of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complex-ity 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 , the one of Fitting and Massacci for modal logic.
引用
收藏
页码:34 / 48
页数:15
相关论文
共 50 条
  • [1] COMPLEXITY RESULTS FOR MODAL LOGIC WITH RECURSION VIA TRANSLATIONS AND TABLEAUX
    Aceto, Luca
    Achilleos, Antonis
    Anastasiadi, Elli
    Francalanza, Adrian
    Ingolfsdottir, Anna
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 30 (03) : 1 - 14
  • [2] Characterizing contrasimilarity through games, modal logic, and complexity
    Bisping, Benjamin
    Montanari, Luisa
    INFORMATION AND COMPUTATION, 2024, 300
  • [3] Some Modal and Temporal Translations of Generalized Basic Logic
    Fussner, Wesley
    Botero, William Zuluaga
    RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE (RAMICS 2021), 2021, 13027 : 176 - 191
  • [4] Complexity Results for Modal Dependence Logic
    Peter Lohmann
    Heribert Vollmer
    Studia Logica, 2013, 101 : 343 - 366
  • [5] Complexity Results for Modal Dependence Logic
    Lohmann, Peter
    Vollmer, Heribert
    STUDIA LOGICA, 2013, 101 (02) : 343 - 366
  • [6] Complexity Results for Modal Dependence Logic
    Lohmann, Peter
    Vollmer, Heribert
    COMPUTER SCIENCE LOGIC, 2010, 6247 : 411 - 425
  • [7] Conservative translations of four-valued logics in modal logic
    Ekaterina Kubyshkina
    Synthese, 2021, 198 : 5555 - 5571
  • [8] Conservative translations of four-valued logics in modal logic
    Kubyshkina, Ekaterina
    SYNTHESE, 2021, 198 (SUPPL 22) : 5555 - 5571
  • [9] Complexity of Model Checking for Modal Dependence Logic
    Ebbing, Johannes
    Lohmann, Peter
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 226 - 237
  • [10] CANONICAL MODELS AND THE COMPLEXITY OF MODAL TEAM LOGIC
    Lueck, Martin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2019, 15 (02) : 2:1 - 2:45