From regular expressions to deterministic automata
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
An essay in combinatory dynamic logic
Information and Computation
Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Dynamic Logic
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
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
Clausal Tableaux for Hybrid PDL
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal and cut-free tableaux for propositional dynamic logic with converse
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Terminating tableaux for hybrid logic with eventualities
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Clausal Tableaux for Hybrid PDL
Electronic Notes in Theoretical Computer Science (ENTCS)
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.00 |
We present the first tableau-based decision procedure for PDL with nominals. The procedure is based on a prefix-free clausal tableau system designed as a basis for gracefully degrading reasoners. The clausal system factorizes reasoning into regular, propositional, and modal reasoning. This yields a modular decision procedure and pays off in transparent correctness proofs.