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.
KeywordsDescription Logic Atomic Proposition Forest Model Kripke Structure Input Tree
Unable to display preview. Download preview PDF.
- [BHS02]Baader, F., Horrocks, I., Sattler, U.: Description logics for the semantic web. KI – Künstliche Intelligenz, 3,(2002)Google Scholar
- [BC96]Bhat, G., Cleaveland, R.: Efficient local model-checking for fragments of the modal mu-calculus. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 107–126. Springer, Heidelberg (1996)Google Scholar
- [BL+06]P.A. Bonatti, C. Lutz, A. Murano and M.Y. Vardi. The Complexity of Enriched μ-calculi. Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, LTCS-Report, LTCS-06-02, Germany,(2006) see http://lat.inf.tu-dresden.de/research/reports.html
- [CGL01]Calvanese, D., De Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI 1999), pp. 84–89 (1999)Google Scholar
- [KSV02]Vardi, M.Y., Kupferman, O., Sattler, U.: The Complexity of the Graded mgr-Calculus. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 423–437. Springer, Heidelberg (2002)Google Scholar
- [Saf89]Safra, S.: Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel (1989)Google Scholar
- [Tho90]Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science, pp. 133–191 (1990)Google Scholar
- [Tho97]Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389–455 (1997)Google Scholar