## Journal of Symbolic Logic

### 2-ExpTime lower bounds for propositional dynamic logics with intersection

#### Abstract

In 1984, Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidable in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004, the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime, thus 2-ExpTime-complete. We then sharpen our lower bound, showing that it even applies to IPDL without the test operator interpreted on tree structures.

#### Article information

Source
J. Symbolic Logic, Volume 70, Issue 4 (2005), 1072-1086.

Dates
First available in Project Euclid: 18 October 2005

https://projecteuclid.org/euclid.jsl/1129642115

Digital Object Identifier
doi:10.2178/jsl/1129642115

Mathematical Reviews number (MathSciNet)
MR2194237

Zentralblatt MATH identifier
1100.03017

#### Citation

Lange, Martin; Lutz, Carsten. 2-ExpTime lower bounds for propositional dynamic logics with intersection. J. Symbolic Logic 70 (2005), no. 4, 1072--1086. doi:10.2178/jsl/1129642115. https://projecteuclid.org/euclid.jsl/1129642115

#### References

• K. Abrahamson Decidability and expressiveness of logics of processes, Ph.D. thesis, University of Washington, Seattle,1980.
• 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.
• 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.
• 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.
• F. Baader, D. L. McGuiness, D. Nardi, and P. Patel-Schneider The description logic handbook: Theory, implementation and applications, Cambridge University Press,2003.
• 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.
• A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer Alternation, Journal of the ACM, vol. 28 (1981), no. 1, pp. 114--133.
• 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.
• 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.
• 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.
• 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.
• R. Goldblatt Parallel action: Concurrent dynamic logic with independent modalities, Studia Logica, vol. 51 (1992), no. 3--4, pp. 551--578.
• D. Harel Dynamic logic, Handbook of philosophical logic, volume II (D. M. Gabbay and F. Guenthner, editors), D. Reidel Publishers,1984, pp. 496--604.
• D. Harel, D. Kozen, and J. Tiuryn Dynamic logic, MIT Press,2000.
• 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.
• D. Harel and R. Sherman Looping versus repeating in dynamic logic, Information and control, vol. 55 (1982), pp. 175--192.
• J. Johannsen and M. Lange CTL$^+$ 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• V. Pratt Considerations on Floyd-Hoare logic, IEEE Symposium on Foundations of Computer Science (FOCS), 1976, pp. 109--121.
• 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.
• 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.
• 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.
• 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.