Iterated Belief Change, Computationally
Iterated Belief Change is the research area that investigates principles for the dynamics of beliefs over (possibly unlimited) many subsequent belief changes. In this paper, we demonstrate how iterated belief change is connected to computation. In particular, we show that iterative belief revision is Turing complete, even under the condition that broadly accepted principles like the Darwiche-Pearl postulates for iterated revision hold.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Iterated Belief Base Revision: A Dynamic Epistemic Logic Approach
AGM's belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been largely used to specify the agent's belief state - whether represen…
An Investigation of Darwiche and Pearl's Postulates for Iterated Belief Update
Belief revision and update, two significant types of belief change, both focus on how an agent modify her beliefs in presence of new information. The most striking difference between them is that the former studies the c…
Extending the Harper Identity to Iterated Belief Change
The field of iterated belief change has focused mainly on revision, with the other main operator of AGM belief change theory, i.e. contraction, receiving relatively little attention. In this paper we extend the Harper Id…
Bringing Belief Base Change into Dynamic Epistemic Logic
AGM's belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been primarily used to specify the agent's belief state. While the conne…
A Conditional Perspective for Iterated Belief Contraction
According to Boutillier, Darwiche, Pearl and others, principles for iterated revision can be characterised in terms of changing beliefs about conditionals. For iterated contraction a similar formulation is not known. Thi…