Determinism and non-determinism in PDL
Theoretical Computer Science
Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Dynamic Logic
On the expressive power of Dynamic Logic (Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the dynamics of delegation, cooperation, and control: a logical account
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Logics of propositional control
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
On the logic of cooperation and propositional control
Artificial Intelligence
Reasoning about the transfer of control
Journal of Artificial Intelligence Research
From Situation Calculus to Dynamic Epistemic Logic
Journal of Logic and Computation
A dynamic logic of normative systems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional Assignments (DL-PA). The atomic programs of DL-PA are assignments of propositional variables to true or to false. We show that DL-PA behaves better than PDL, having e.g. compactness and eliminability of the Kleene star. We establish tight complexity results: both satisfiability and model checking are EXPTIME-complete.