Propositional Dynamic Logic as a Logic of Knowledge Update and Belief Revision
نویسندگان
چکیده
This talk shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent knowledge update and belief revision, or as a logic of preference change, if the basic relations are read as preferences instead of plausibilities. Our point of departure is the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of epistemic/doxastic PDL with a belief change modality. Next, we show that the properties of knowledge and belief are preserved under any update, unlike in LCC. We prove completeness of the logic and give examples of its use. If there is time, we will also look at the preference interpretation of the system, and at preference change scenarios that can be modelled with it.
منابع مشابه
Propositional Dynamic Logic as a Logic of Belief Revision
This paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL ...
متن کاملBelief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments
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 ...
متن کاملYet More Modal Logics of Preference Change and Belief Revision
We contrast Bonanno’s ‘Belief Revision in a Temporal Framework’ [15] with preference change and belief revision from the perspective of dynamic epistemic logic (DEL). For that, we extend the logic of communication and change of [11] with relational substitutions [8] for preference change, and show that this does not alter its properties. Next we move to a more constrained context where belief a...
متن کاملA Qualitative Theory of Dynamic Interactive Belief Revision
We present a logical setting that incorporates a belief-revision mechanism within Dynamic-Epistemic logic. As the “static” basis for belief revision, we use epistemic plausibility models, together with a modal language based on two epistemic operators: a “knowledge” modality K (the standard S5, fully introspective, notion), and a “safe belief” modality 2 (“weak”, non-negatively-introspective, n...
متن کاملOn the Use of Complex Matrices for Belief Revision
A most crucial problem in knowledge representation is the revision of knowledge when new, possibly contradictory, information is obtained (belief revision). In this paper, we address this problem for propositional knowledge bases. We introduce a new representation of propositional expressions using 2dimensional matrices and describe the intuitive processes leading to this representation. We pre...
متن کامل