Complexity results for modal logic with recursion via translations and tableaux
type: Item
instance of: scholarly article
title: Complexity results for modal logic with recursion via translations and tableaux
author: Luca Aceto
author: Antonis Achilleos
author: Elli Anastasiadi
author: Adrian Francalanza
author: Anna Ingolfsdottir
published in: Logical Methods in Computer Science
publication date: 2024-09-04T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7906376
MaRDI profile type: Publication
cites work: Q6191004
cites work: The complexity of identifying characteristic formulae
cites work: The modalμ-calculus hierarchy over restricted classes of transition systems
cites work: Q3483262
cites work: Modal logic
cites work: Unifying Hyper and Epistemic Temporal Logics
cites work: The mu-calculus and Model Checking
cites work: Handbook of Model Checking
cites work: Deciding parity games in quasipolynomial time
cites work: Deciding Parity Games in Quasi-polynomial Time
cites work: On the \(\mu \)-calculus over transitive and finite transitive frames
cites work: On modal \(\mu \)-calculus in \(S5\) and applications
cites work: On the Modal μ-Calculus Over Finite Symmetric Graphs
cites work: The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Q4845472
cites work: Tableau methods of proof for modal logics
cites work: Propositional dynamic logic of regular programs
cites work: Q3408862
cites work: Über das Problem der Wohlordnung.
cites work: Algebraic laws for nondeterminism and concurrency
cites work: A guide to completeness and complexity for modal logics of knowledge and belief
cites work: Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
cites work: Q5144638
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Un théorème sur les fonctions d'ensembles.
cites work: Results on the propositional \(\mu\)-calculus
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: A modal μ perspective on solving parity games in quasi-polynomial time
cites work: Q5028462
cites work: Strongly analytic tableaux for normal modal logics
cites work: The extensions of the modal logic K5
cites work: Complexity of finite-variable fragments of propositional modal logics of symmetric frames
cites work: Q4081211
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
DOI: 10.46298/LMCS-20(3:14)2024
description: scientific article; zbMATH DE number 7906376