In this talk I present Dynamic Logic of Propositional
Assignments(DL-PA): an instance of Propositional Dynamic Logic whose
atomic programs are assignments of propositional variables. I will in
particular establish the relation with Quantified Boolean Formulas,
coming with complexity, expressivity and succinctness results. I show
how several popular knowledge representation formalisms can be captured
in DL-PA, including update and revision operations and planning tasks
and their modification.