Skip to main content
×
Home
    • Aa
    • Aa

2-Exp Time lower bounds for propositional dynamic logics with intersection

  • Martin Lange (a1) and Carsten Lutz (a2)
Abstract
Abstract

In 1984. Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidabie 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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] L. Aeanasiev , 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. 115135.

[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. 939956.

[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. 149158.

[7] A. K. Chandra , D. C. Kozen , and L. J. Stockmeyer , Alternation, Journal of the ACM, vol. 28 (1981), no. 1, pp. 114133.

[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. 3453.

[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. 158.

[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. 194211.

[12] R. Goldblatt , Parallel action: Concurrent dynamic logic with independent modalities, Studia Logica, vol. 51 (1992), no. 3-4, pp. 551578.

[16] D. Harel and R. Sherman , Looping versus repeating in dynamic logic, Information and control, vol. 55 (1982), pp. 175192.

[21] C. Lutz and D. Walther , PDL with negation of atomic programs, Journal of Applied Non-Classical Logic, vol. 15 (2005), no. 2, pp. 189214.

[23] A. J. Mayer and L. J. Stockmeyer , The complexity of PDL with interleaving, Theoretical Computer Science, vol. 161 (1996), no. 1-2, pp. 109122.

[28] R. S. Streett , Propositional dynamic logic of looping and converse is elementarily decidable, Information and Control, vol. 54 (1982), no. 1-2, pp. 121141.

[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. 413424.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 77 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 16th August 2017. This data will be updated every 24 hours.