NP reasoning in the monotone -calculus
From MaRDI portal
Publication:2096471
DOI10.1007/978-3-030-51074-9_28OpenAlexW3039203491MaRDI QIDQ2096471FDOQ2096471
Authors: Daniel Hausmann, Lutz Schröder 
Publication date: 9 November 2022
Full work available at URL: https://arxiv.org/abs/2002.05075
Cites Work
- Infinite Games
- Propositional dynamic logic of regular programs
- Modal logics and mu-calculi: An introduction
- Using the Universal Modality: Gains and Questions
- Concurrent dynamic logic
- Title not available (Why is that?)
- Alternating finite automata on \(\omega\)-words
- Title not available (Why is that?)
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Game logic -- an overview
- A coalgebraic perspective on monotone modal logic
- On guarded transformation in the modal \(\mu\)-calculus
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- Normal monomodal logics can simulate all others
- Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
- Deciding the unguarded modal \(\mu\)-calculus
- Monadic second-order logic and bisimulation invariance for coalgebras
- EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
- A propositional dynamic logic for instantial neighborhood semantics
- Global caching for the alternation-free \(\mu\)-calculus
This page was built for publication: NP reasoning in the monotone \(\mu\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096471)
