2026-07-20T05:58:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1409 2024-03-06T11:07:45Z ddc:004 open_access

PDL with Intersection and Converse is 2EXP-complete Göller, Stefan Lohrey, Markus Lutz, Carsten Satisfiability Propositional Dynamic Logic Computational Complexity The logic ICPDL is the expressive extension of Propositional Dynamic Logic (PDL), which admits intersection and converse as program operators. The result of this paper is containment of ICPDL-satisfiability in $2$EXP, which improves the previously known non-elementary upper bound and implies $2$EXP-completeness due to an existing lower bound for PDL with intersection (IPDL). The proof proceeds showing that every satisfiable ICPDL formula has model of tree width at most two. Next, we reduce satisfiability in ICPDL to $omega$-regular tree satisfiability in ICPDL. In the latter problem the set of possible models is restricted to trees of an $omega$-regular tree language. In the final step,$omega$-regular tree satisfiability is reduced the emptiness problem for alternating two-way automata on infinite trees. In this way, a more elegant proof is obtained for Danecki's difficult result that satisfiability in IPDL is in $2EXP$. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefan Göller and Markus Lohrey and Carsten Lutz 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 7441, Algorithmic-Logical Theory of Infinite Structures (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07441.5 urn:nbn:de:0030-drops-14093 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.5 eng https://creativecommons.org/licenses/by/4.0/legalcode