“…Dynamic Logic of Propositional Assignments DL-PA [BHT13,BHST14] is a version of Propositional Dynamic Logic PDL whose atomic programs are assignments of propositional variables p to true or false, respectively written +p and −p. We and coauthors have shown that many knowledge representation concepts and formalisms can be captured in DL-PA, such as update and revision operations [Her14], database base fusion and repair operations [FHR19], planning [HMNDBW14,HMV19], lightweight dynamic epistemic logics [CS15,CHM + 16,CS17], and judgment aggregation [NGH18]. The mathematical properties of DL-PA are simpler than those of PDL, in particular, the Kleene star can be eliminated [BHT13] and satisfiability and model checking are both PSPACE complete [BHST14].…”