The logic of KM belief update is contained in the logic of AGM belief revision
Abstract
For each axiom of KM belief update we provide a corresponding axiom in a modal logic containing three modal operators: a unimodal belief operator $B$, a bimodal conditional operator $>$ and the unimodal necessity operator $\square$. We then compare the resulting logic to the similar logic obtained from converting the AGM axioms of belief revision into modal axioms and show that the latter contains the former. Denoting the latter by $\mathcal L_{AGM}$ and the former by $\mathcal L_{KM}$ we show t...
Description / Details
For each axiom of KM belief update we provide a corresponding axiom in a modal logic containing three modal operators: a unimodal belief operator , a bimodal conditional operator and the unimodal necessity operator . We then compare the resulting logic to the similar logic obtained from converting the AGM axioms of belief revision into modal axioms and show that the latter contains the former. Denoting the latter by and the former by we show that every axiom of is a theorem of . Thus AGM belief revision can be seen as a special case of KM belief update. For the strong version of KM belief update we show that the difference between and can be narrowed down to a single axiom, which deals exclusively with unsurprising information, that is, with formulas that were not initially disbelieved.
Source: arXiv:2602.23302v1 - http://arxiv.org/abs/2602.23302v1 PDF: https://arxiv.org/pdf/2602.23302v1 Original Link: http://arxiv.org/abs/2602.23302v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Feb 27, 2026
Artificial Intelligence
AI
0