Skip to content

Selective Credibility-Limited Belief Update

Jul 2026 · arXiv.org · Vol abs/2607.28523 · 0 citations · 24 references
Computer Science

TL;DR

The generality of the proposed framework is established by showing that credibility-limited belief update is recovered as a special case, while Katsuno--Mendelzon belief update emerges when credibility restrictions are removed and the transformation functions are taken to be identities.

Abstract

Belief update concerns changes in an agent's beliefs induced by changes in the underlying world. Standard Katsuno-Mendelzon update assumes that an epistemic input can be incorporated from every initially possible world, whereas credibility-limited belief update restricts, for each source world, the successor worlds regarded as credible or reachable. Nevertheless, existing credibility-limited approaches treat the epistemic input as an indivisible whole, and therefore cannot represent cases in which only part of a compound epistemic input can be realized. We introduce selective credibility-limited belief update, in which the epistemic input is transformed, relative to each source world, into a weaker proxy before the credibility-limited transition is performed. We provide semantic and axiomatic characterizations of the resulting class of update operators. We then identify two well-behaved sub-classes; namely, consistency-preserving update operators, which require every transformed epistemic input to be credible from its source world whenever the original epistemic input is consistent, and maximal consistency-preserving update operators, which additionally require the selected proxy to be maximally informative among the credible consequences of the original epistemic input. Finally, we establish the generality of the proposed framework by showing that credibility-limited belief update is recovered as a special case, while Katsuno--Mendelzon belief update emerges when credibility restrictions are removed and the transformation functions are taken to be identities. These results demonstrate that the framework provides a unified and strictly more expressive account of belief update, encompassing established approaches while supporting source-dependent selective acceptance.

View source

Similar papers

Open access Aug 2026

Beyond Static Assumptions: The Predictive Justified Perspective Model for Epistemic Planning

The Predictive Justified Perspective (PJP) model is formally defined and proved that it retains the computational efficiency of state-based planning while ensuring logically sound belief reasoning (satisfying the KD45 axioms).

Guang Hu, Weijia Li, Yangmengfei Xu · 0 citations
#artificial intelligence Preprint Sep 2026

Belief-Calibrated Optimization: An Explicit World Model for Agentic Optimization

The performance of an LLM agent depends on the scaffold around a frozen model. A common way to improve that scaffold is to use a coding agent as an optimizer: it reads current scores and traces and iteratively edits the source, producing a new candidate each round. Each edit is chosen according to a belief about how th...

Yu-Han Chen, Zhi-Hua Tian, Mahavir Dabas et al. · 0 citations
Conference Open access Sep 2026

Merging Beliefs and Counterfactuals

We present a unified framework for modeling agents’ epistemic states and counterfactual conditionals. The novelty of our approach lies at the semantic level. We introduce a computationally grounded semantics in which an agent’s doxastic accessibility relation, needed to model the standard notion of deductively closed...

E. Lorini, Dmitry Rozplokhas · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.