Belief change operations: a short history of nearly everything, told in dynamic logic of propositional assignments

Abstract

We examine several belief change operations in the light of Dynamic Logic of Propositional Assignments DL-PA. We show that we can encode in a systematic way update operations (such as Winslett’s ‘Possible Models Approach’) and revision operations (such as Dalal’s) as particular DL-PA programs. Every DL-PA formula being equivalent to a boolean formula, we obtain syntactical counterparts for all these belief change operations.