An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability

Authors:
Pietro Abate;Rajeev Goré;Florian Widmann
Affiliations:
Computer Sciences Laboratory, The Australian National University, Canberra, Australia;Computer Sciences Laboratory, The Australian National University, Canberra, Australia;Computer Sciences Laboratory and Logic & Computation Programme, The Australian National University and NICTA, Canberra, Australia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 6

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
Tableau-based model checking in the propositional mu-calculus

Acta Informatica
Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Information and Computation
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A New One-Pass Tableau Calculus for PLTL

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Efficient On-the-Fly Model Checking for CTL

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
One-pass tableaux for computation tree logic

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Clausal Tableaux for Hybrid PDL

Electronic Notes in Theoretical Computer Science (ENTCS)
Terminating tableaux for hybrid logic with eventualities

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Tableaux for type PDL

Proceedings of the 6th Balkan Conference in Informatics
A Goal-Directed Decision Procedure for Hybrid PDL

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good loops from bad loops during backtracking. It is easy to implement, with potential for parallelisation, because it constructs a pseudo-model ''on the fly'' by exploring each tableau branch independently. But its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB (http://twb.rsise.anu.edu.au) is available.