57 citations · 75 across the 21 of their papers we have counts for
Showing 2014 · cs.LOShow all
2 papers · 2 filters
cs.LO2014
DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE
Philippe Balbiani, Andreas Herzig, François Schwarzentruber +1
We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation…
cs.LO2014
A simple proof of the completeness of APAL
Philippe Balbiani, Hans van Ditmarsch
We provide a simple proof of the completeness of arbitrary public announcement logic APAL. The proof is an improvement over the proof found in the publication Knowable as Known aft…