A decision procedure for alternation-free modal -calculi
From MaRDI portal
Publication:3085177
Recommendations
- Automated Reasoning with Analytic Tableaux and Related Methods
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- scientific article; zbMATH DE number 3898850
- scientific article; zbMATH DE number 1765663
Cited in
(10)- scientific article; zbMATH DE number 3885877 (Why is no real title available?)
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- scientific article; zbMATH DE number 1765663 (Why is no real title available?)
- Deciding the unguarded modal \(\mu\)-calculus
- Efficiently deciding \(\mu\)-calculus with converse over finite trees
- A focus system for the alternation-free \(\mu \)-calculus
- scientific article; zbMATH DE number 1954388 (Why is no real title available?)
- Automated Reasoning with Analytic Tableaux and Related Methods
- scientific article; zbMATH DE number 1136070 (Why is no real title available?)
- scientific article; zbMATH DE number 1696780 (Why is no real title available?)
This page was built for publication: A decision procedure for alternation-free modal \(\mu\)-calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085177)