2-ExpTime lower bounds for propositional dynamic logics with intersection

Journal of Symbolic Logic

Volumn 70, Issue 4, 2005, Pages 1072-1086

  Lange, Martin ^a   Lutz, Carsten ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 32244440302     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1129642115     Document Type: Review

References (30)

1. K. ABRAHAMSON. Decidability and expressiveness of logics of processes, Ph.D. thesis, University of Washington, Seattle, 1980.
2. L. AFANASIEV, P. BLACKBURN, I. DIMITRIOU, B. GAIFFE, E. GORIS, M. MAARX, and M. DE RIJKE, PDL for ordered trees. Journal of Applied Non-Classical Logic, vol. 15 (2005), no. 2, pp. 115-135.
3. N. ALECHINA, S. DEMRI, and M. DE RIJKE, A modal perspective on path constraints, Journal of Logic and Computation, vol. 13 (2003), no. 6, pp. 939-956.
4. F. BAADER, Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. Proceedings of the twelfth international joint conference on artificial intelligence (IJCAI-91), Sydney, Australia, 1991, pp. 446-451.
5. F. BAADER, D. L. MCGUINESS, D. NARDI, and P. PATEL-SCHNEIDER, The description logic handbook: Theory, implementation and applications, Cambridge University Press, 2003.
6. D. CALVANESE, G. DE GIACOMO, and M. LENZERINI, On the decidability of query containment under constraints, Proceedings of the 17th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS'98), 1998, pp. 149-158.
7. A. K. CHANDRA, D. C. KOZEN, and L. J. STOCKMEYER, Alternation. Journal of the ACM, vol. 28 (1981), no. 1, pp. 114-133.
8. R. DANECKI, Nondeterministic propositional dynamic logic with intersection is decidable. Proceedings of the Fifth Symposium on Computation Theory (Zaborów, Poland) (A. Skowron. editor), LNCS, vol. 208, Springer. 1984, pp. 34-53.
9. F. M. DONINI, M. LENZERINI, D. NARDI, and W. NUTT, The complexity of concept languages, Information and Computation, vol. 134 (1997), no. 1, pp. 1-58.
10. M. J. FISCHER and R. E. LADNER, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol. 18 (1979), no. 2, pp. 194-211.
11. G. DE GIACOMO and M. LENZERINI, Boosting the correspondence between description logics and propositional dynamic logics, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), Volume 1, AAAI Press, 1994, pp. 205-212.
12. R. GOLDBLATT, Parallel action: Concurrent dynamic logic with independent modalities, Studia Logica, vol. 51 (1992), no. 3-4, pp. 551-578.
13. D. HAREL, Dynamic logic, Handbook of philosophical logic, volume II (D. M. Gabbay and F. Guenthner, editors), D. Reidel Publishers, 1984, pp. 496-604.
14. D. HAREL, D. KOZEN, and J. TIURYN, Dynamic logic, MIT Press, 2000.
15. D. HAREL, R. ROSNER, and M. VARDI, On the power of bounded concurrency III: Reasoning about programs. Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (J. C. Mitchell, editor), IEEE Computer Society Press, 1990, pp. 478-488.
16. D. HAREL and R. SHERMAN, Looping versus repeating in dynamic logic, Information and control, vol. 55 (1982), pp. 175-192.
17. + is complete for double exponential time, ICALP: Annual International Colloquium on Automata, Languages and Programming (J. C. M. Baeten et al., editors), LNCS, vol. 2719, Springer. 2003, pp. 767-775.
18. D. C. KOZEN and J. TIURYN, Logics of programs, Handbook of theoretical computer science (J. van Leewen, editor), vol. B: Formal Models and Semantics, The MIT Press, 1990, pp. 789-840.
19. M. LANGE, A lower complexity bound for propositional dynamic logic with intersection, Advances in modal logic volume 5 (R. A. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, editors), King's College Publications, 2005, pp. 133-147.
20. C. LUTZ and U. SATTLER, Mary likes all cats, Proceedings of the 2000 International Workshop in Description Logics (DL2000) (F. Baader and U. Sattler, editors), CEUR-WS (http://ceur-ws.org/), no. 33, 2000, pp. 213-226.
21. C. LUTZ and D. WALTHER, PDL with negation of atomic programs, Journal of Applied Non-Classical Logic, vol. 15 (2005), no. 2, pp. 189-214.
22. F. MASSACCI, Decision procedures for expressive description logics with role intersection, composition and converse, Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI-01) (B. Nebel, editor), Morgan Kaufmann Publishers, Inc., San Francisco, CA, 2001, pp. 193-198.
23. A. J. MAYER and L. J. STOCKMEYER, The complexity of PDL with interleaving. Theoretical Computer Science, vol. 161 (1996), no. 1-2, pp. 109-122.
24. D. PELEG, Concurrent dynamic logic, Proceedings of the seventeenth annual ACM Symposium on Theory of Computing, Providence, Rhode Island, May 6-8, 1985, ACM Press, 1985, pp. 232-239.
25. V. PRATT, Considerations on Floyd-Hoare logic, IEEE Symposium on Foundations of Computer Science (FOCS), 1976, pp. 109-121.
26. K. D. SCHILD, A correspondence theory for terminological logics: Preliminary report, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91) (John Mylopoulos and Ray Reiter, editors), Morgan Kaufmann, 1991, pp. 466-471.
27. _, Combining terminological logics with tense logic. Progress in artificial intelligence - 6th Portuguese Conference on Artificial Intelligence, EPIA'93 (M. Filgueiras and L. Damas, editors), Lecture Notes in Artificial Intelligence, vol. 727, Springer-Verlag, 1993, pp. 105-120.
28. R. S. STREETT, Propositional dynamic logic of looping and converse is elementarily decidable, Information and Control, vol. 54 (1982), no. 1-2, pp. 121-141.
29. M. Y. VARDI, The taming of converse: Reasoning about two-way computations, Proceedings of the Conference on Logic of Programs (Rohit Parikh, editor), LNCS, vol. 193, Springer, 1985, pp. 413-424.
30. M. Y. VARDI and L. STOCKMEYER, Improved upper and lower bounds for modal logics of programs, Proceedings of the seventeenth annual ACM Symposium on Theory of Computing, Providence, Rhode Island, May 6-8,1985, ACM Press, 1985, pp. 240-251.