In its many guises and variations, prepositional dynamic logic (PDL) plays an important role in various areas of computer science such as databases, artificial intelligence, and computer linguistics. One relevant and powerful variation is ICPDL, the extension of PDL with intersection and converse. Although ICPDL has several interesting applications, its computational properties have never been investigated. In this paper, we prove that ICPDL is decidable by developing a translation to the monadic second order logic of infinite trees. Our result has applications in information logic, description logic, and epistemic logic. In particular, we solve a long-standing open problem in information logic. Another virtue of our approach is that it provides a decidability proof that is more transparent than existing ones for PDL with intersection (but without converse). © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Lutz, G. (2005). PDL with intersection and converse is decidable. In Lecture Notes in Computer Science (Vol. 3634, pp. 413–427). Springer Verlag. https://doi.org/10.1007/11538363_29
Mendeley helps you to discover research relevant for your work.