Theoretical Computer Science
Alternating automata on infinite trees
Theoretical Computer Science
Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Dynamic logic for reasoning about actions and agents
Logic-based artificial intelligence
Dynamic Logic
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Taming of Converse: Reasoning about Two-way Computations
Proceedings of the Conference on Logic of Programs
Concurrent dynamic epistemic logic for MAS
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
PDL with intersection and converse is decidable
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Run-Time Monitoring of Electronic Contracts
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
On the complexity of reasoning about dynamic policies
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We study the complexity of satisfiability in the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Our main result is containment in 2EXP, which improves the previously known non-elementary upper bound and implies 2EXP- completeness due to an existing lower bound for PDL with intersection. The proof proceeds by showing that every satisfiable ICPDL formula has a model of tree-width at most two and then giving a reduction to the (non)-emptiness problem for alternating two-way automata on infinite trees. In this way, we also reprove in an elegant way Danecki's difficult result that satisfiability for PDL with intersection is in 2EXP.