Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Automata theory for database theoreticians
Theoretical studies in computer science
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Languages, automata, and logic
Handbook of formal languages, vol. 3
Theoretical Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On the Boundedness Problem for Two-Variable First-Order Logic
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Deciding if Deterministic Rabin Language Is in Büchi Class
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Deciding the First Level of the µ-Calculus Alternation Hierarchy
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Automata logics, and infinite games
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Continuous Fragment of the mu-Calculus
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boundedness of Monadic Second-Order Formulae over Finite Words
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Characterizing EF over infinite trees and modal logic on transitive graphs
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On deciding topological classes of deterministic tree languages
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Boundedness of monadic FO over acyclic structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
First-order rewritability of atomic queries in horn description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Consider the following problem: given a formula of the modal µ-calculus, decide whether this formula is equivalently expressible in basic modal logic. It is shown that this problem is decidable, in fact in deterministic exponential time. The decidability result can be obtained through a model theoretic reduction to the monadic second-order theory of the complete binary tree, which by Rabin's classical result is decidable, albeit of non-elementary complexity. An improved analysis based on tree automata yields an exponential time decision procedure.