The Complexity of Enriched µ-Calculi

The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable and ExpTime-complete, it has recently been proved that the full calculus is undecidable. In this paper, we study the fragments of the fully enriched μ-calculus that are obtained by dropping at least one of the additional constructs. We show that, in all fragments obtained in this way, satisfiability is decidable and ExpTime-complete. Thus, we identify a family of decidable logics that are maximal (and incomparable) in expressive power. Our results are obtained by introducing two new automata models, showing that their emptiness problems are ExpTime-complete, and then reducing satisfiability in the relevant logics to this problem. The automata models we introduce are two-way graded alternating parity automata over infinite trees (2GAPT) and fully enriched automata (FEA) over infinite forests. The former are a common generalization of two incomparable automata models from the literature. The latter extend alternating automata in a similar way as the fully enriched μ-calculus extends the standard μ-calculus

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Orna Kupferman,et al.  Weak alternating automata and tree automata emptiness , 1998, STOC '98.

[3]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[4]  Moshe Y. Vardi,et al.  The Hybrid mu-Calculus , 2001 .

[5]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[6]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[7]  Ian Horrocks,et al.  Description Logics for the Semantic Web , 2002, Künstliche Intell..

[8]  Giuseppe De Giacomo,et al.  Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees , 1999, IJCAI.

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Charanjit S. Jutla,et al.  Determinization and Memoryless Winning Strategies , 1997, Inf. Comput..

[12]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[13]  Girish Bhat,et al.  Efficient Local Model-Checking for Fragments of the Modal p-Calculus , 2005 .

[14]  Ulrike Sattler,et al.  The Complexity of the Graded µ-Calculus , 2002, CADE.

[15]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[16]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[17]  Ulrike Sattler,et al.  The Hybrid µ-Calculus , 2001, IJCAR.

[18]  Y VardiMoshe,et al.  An automata-theoretic approach to branching-time model checking , 2000 .

[19]  Piero A. Bonatti,et al.  On the undecidability of logics with converse, nominals, recursion and counting , 2004, Artif. Intell..

[20]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[21]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[22]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

[23]  Girish Bhat,et al.  Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus , 1996, TACAS.

[24]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[25]  Moshe Y. Vardi.  Automata-Theoretic Model Checking Revisited , 2007, VMCAI.