Complexity results for modal logic with recursion via translations and tableaux

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
On the \(\mu \)-calculus over transitive and finite transitive frames
Results on the propositional \(\mu\)-calculus
A guide to completeness and complexity for modal logics of knowledge and belief
Propositional dynamic logic of regular programs
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Un théorème sur les fonctions d'ensembles.
Über das Problem der Wohlordnung.
The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
The complexity of identifying characteristic formulae
Tableau methods of proof for modal logics
A lattice-theoretical fixpoint theorem and its applications
On Modal μ-Calculus in S5 and Applications
Unifying Hyper and Epistemic Temporal Logics
The mu-calculus and Model Checking
On the Modal μ-Calculus Over Finite Symmetric Graphs
The modalμ-calculus hierarchy over restricted classes of transition systems
The extensions of the modal logic K5
Algebraic laws for nondeterminism and concurrency
The Computational Complexity of Provability in Systems of Modal Propositional Logic
Handbook of Model Checking
Deciding parity games in quasipolynomial time
Deciding Parity Games in Quasi-polynomial Time
A modal μ perspective on solving parity games in quasi-polynomial time
Strongly analytic tableaux for normal modal logics
Complexity of finite-variable fragments of propositional modal logics of symmetric frames
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Complexity results for modal logic with recursion via translations and tableaux