Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Dynamic Logic
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
An Optimal Tableau Decision Procedure for Converse-PDL
KSE '09 Proceedings of the 2009 International Conference on Knowledge and Systems Engineering
Optimal and cut-free tableaux for propositional dynamic logic with converse
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
We give a deterministic exponential, sound and complete tableau-based satisfiability algorithm for the system of Type PDL (τPDL) [9, 8], by extending the algorithm of Goré and Widmann [6] that has been given for the case of the CPDL. The system of τPDL has been introduced to reason about types of actions and while the type semantics have been adopted in [9], here, we follow the standard relational semantics as they have been presented in [8]. We introduce an appropriate tableau calculus for the satisfiability algorithm and in relation with the case of the CPDL, the algorithm that we present for τPDL, handles the backwards possibility operator instead of the converse operator, as well as capabilities statements and abstract processes which are defined as pairs of preconditions and effects, written as φ ⇒ ψ.