The complexity of enriched μ-calculi

Logical Methods in Computer Science

Volumn 4, Issue 3, 2008, Pages

  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

calculi; 2 way graded alternating parity automata; Expressive description logics; Fully enriched automata; Hybrid modal logics

Indexed keywords

2-WAY GRADED ALTERNATING PARITY AUTOMATA; ALTERNATING AUTOMATA; AUTOMATA MODELS; EMPTINESS PROBLEM; EXPRESSIVE DESCRIPTION LOGIC; EXPRESSIVE POWER; FULLY ENRICHED AUTOMATA; HYBRID MODAL LOGIC;

BIOMINERALIZATION; CALCULATIONS; DATA DESCRIPTION; FORMAL LOGIC; PATHOLOGY; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; INVERSE PROBLEMS;

AUTOMATA THEORY; CALCULATIONS;

EID: 84879696110     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(3:11)2008     Document Type: Article

References (23)

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 mu-calculus. In Proc. of TACAS'96, LNCS 1055, pages 107-126, 1996.
4. [BP04] P. A. Bonatti and A. Peron. On the undecidability of logics with converse, nominals, recursion and counting. Artificial Intelligence, Vol. 158(1), pages 75-96, 2004.
5. [BS06] J. Bradfield and C. Stirling. Modal μ-calculi, Handbook of Modal Logic (Blackburn, Wolter, and van Benthem, eds.), pages 722-756, Elsevier, 2006.
6. [CGL99] 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. [EJ91] E. A. Emerson and C. S. Jutla. Tree automata, Mu-Calculus and determinacy. In Proc. of the 32nd Annual Symposium on Foundations of Computer Science (FOCS'01), IEEE Computer Society Press, pages 368-377, 1991.
8. [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.
9. [Jut95] C. S. Jutla. Determinization and memoryless winning strategies. Information and Computation, Vol. 133(2), pages 117-134, 1997.
10. [Koz83] D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, Vol. 27, pages 333-354, 1983.
11. [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. Extended version at URL http://www. cs. huji. ac. il/ornak/publications/cade02. pdf.
12. [KV98] O. Kupferman and M. Y. Vardi. Weak alternating automata and tree automata emptiness. Proc. of the 30th STOC, ACM, pages 224-233, 1998.
13. [KVW00] O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branchingtime model checking. Journal of the ACM, Vol. 47(2), pages 312-360, 2000.
14. [Mos84] A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Fifth Symposium on Computation Theory, LNCS 208, pages 157-168, 1984.
15. [MS87] D. E. Muller and P. E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, Vol. 54, pages 267-276, 1987.
16. [Saf89] S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.
17. [SV01] U. Sattler and M. Y. Vardi. The hybrid mu-calculus. In Proc. of IJCAR'01, LNAI 2083, pages 76-91. Springer Verlag, 2001.
18. [SE89] R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, Vol. 81(3), pages 249-264, 1989.
19. [Tho90] W. Thomas. Automata on Infinite Objects. In Handbook of Theoretical Computer Science, pages 133-191, 1990.
20. [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.
21. [Var98] M. Y. Vardi. Reasoning about the Past with Two-Way Automata. In Proc. of ICALP'98, LNCS 1443, pages 628-641, 1998.
22. [Var07] M. Y. Vardi. Automata-Theoretic Model Checking Revisited In Proc. of the 8th VMCAI, LNAI 4349, pages 137-150, 2007.
23. [VW94] M. Y. Vardi and P. Wolper. Reasoning about Infinite Computations. Information and Computation, Vol. 115(1), pages 1-37, 1994.