The complexity of enriched μ-calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 540-551

  Bonatti, Piero A ^a   Lutz, Carsten ^b   Murano, Aniello ^a   Vardi, Moshe Y ^c  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

ALTERNATING AUTOMATA; CALCULUS; FRAGMENTS;

COMPUTER PROGRAMMING;

EID: 33746351506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_46     Document Type: Conference Paper

References (17)

1. [BHS02] F. Baader, I. Horrocks, and U. Sattler. Description logics for the semantic web. KI -Künstliche Intelligenz, 3, 2002.
2. [BM+03] F. Baader. D.L. McGuiness, D. Nardi, and P. Patel-Schneider. The Description Logic Handbook: Theory, implementation and applications. Cambridge Univ. Press, 2003.
3. [BC96] G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal mn-calculus. In Proc. of TACAS'96, LNCS 1055, pages 107-126, 1996.
4. [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, 2006, LTCS-Report, LTCS-06-02, Germany, see http://lat.inf.tu-dresden.de/research/reports.html.
5. [BP04] P.A. Bonatti and A. Peron. On the undecidability of logics with converse, nominals, recursion and counting. Artificial Intelligence, 158(1):75-96, 2004.
6. [CGL01] D. Calvanese, G. De Giacomo, and M. Lenzerini. 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'99), pages 84-89, 1999.
7. [FL79] M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, Vol.18, pages 194-211, 1979.
8. [Jut95] C.S. Jutla. Determinization and memoryless winning strategies. Information and Compulation, 133(2): 117-134, 1997.
9. [Koz83] D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, Vol.27, pages 333-354, 1983.
10. [KSV02] O. Kupferman, U. Sattler, and M.Y. Vardi. The complexity of the Graded μ-calculus. In Proc. of the 18th CADE LNAI 2392, pages 423-437, 2002.
11. [KVW00] O. Kupfennan, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, Vol.47(2), pages 312-360, 2000.
12. [MS87] D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, Vol.54, pages 267-276, 1987.
13. [Saf89] S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.
14. [SV01] U. Sattler and M. Y. Vardi. The hybrid mu-calculus. In Proc. of IJCAR'01, Vol.2083 of LNAI, pages 76-91. Springer Verlag, 2001.
15. [Thq90] W. Thomas. Automata on Infinite Objects. In Handbook of Theoretical Computer Science, pages 133-191, 1990.
16. [Tho97] W. Thomas. Languages, automata, and logic. In Handbook of Formal Language Theory, volume III, pages 389-455, G. Rozenberg and A. Salomaa editors, 1997.
17. [Var98] M.Y. Vardi. Reasoning about the Past with Two-Way Automata. In Proc. of ICALP'98, LNCS 1443, pages. 628-641, 1998.