Translator Disclaimer
December 2005 2-ExpTime lower bounds for propositional dynamic logics with intersection
Martin Lange, Carsten Lutz
J. Symbolic Logic 70(4): 1072-1086 (December 2005). DOI: 10.2178/jsl/1129642115

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.

Citation

Download Citation

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

Information

Published: December 2005
First available in Project Euclid: 18 October 2005

zbMATH: 1100.03017
MathSciNet: MR2194237
Digital Object Identifier: 10.2178/jsl/1129642115

Rights: Copyright © 2005 Association for Symbolic Logic

JOURNAL ARTICLE
15 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.70 • No. 4 • December 2005
Back to Top