An Optimal On-the-fly Tableau-based Decision Procedure for PDL satisfiability
We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound method to track unfulfilled eventualities "on the fly" which allows us to detect "bad loops" sooner rather than in multiple subsequent passes. We achieve this by propagating and updating the "status" of nodes throughout the underlying graph as soon as is possible. We give sufficient details to enable an easy implementation by...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 22nd International Conference on Automated Deduction|
|01_Gore_An_Optimal_On-the-fly_2009.pdf||281.84 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.