Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics [chapter]

Mark Kaminski, Thomas Schneider, Gert Smolka
2011 Lecture Notes in Computer Science  
We extend Pratt's worst-case optimal decision procedure for PDL to a richer logic with nominals, difference modalities, and inverse actions. We prove correctness and worst-case optimality. Our correctness proof is based on syntactic models called demos. The main theorem states that a formula is satisfiable if and only if it is contained in a demo. From this theorem the correctness of the decision procedure is easily obtained. Our development is modular and we extend it stepwise from modal logic
more » ... with eventualities to the full logic. ⋆ This is an author version of the contribution to Proc. TABLEAUX 2011. The original publication is available at
doi:10.1007/978-3-642-22119-4_16 fatcat:a3et5obo7zazbm3v2u5435lgue