A decision procedure for alternation-free modal -calculi

zbMATH Open1244.03074MaRDI QIDQ3085177FDOQ3085177

Authors: Yoshinori Tanabe, Koichi Takahashi, Masami Hagiya 

Publication date: 30 March 2011

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

zbMATH Keywords

satisfiabilitydecision proceduremodal \(\mu\)-calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Cited In (10)

• Title not available (Why is that?)
• Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
• Title not available (Why is that?)
• Deciding the unguarded modal \(\mu\)-calculus
• Efficiently deciding \(\mu\)-calculus with converse over finite trees
• A focus system for the alternation-free \(\mu \)-calculus
• Title not available (Why is that?)
• Automated Reasoning with Analytic Tableaux and Related Methods
• Title not available (Why is that?)
• Title not available (Why is that?)

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)