Iterated belief revision, revised

Jin, Yi; Thielscher, Michael

doi:10.1016/j.artint.2006.11.002

Cited by 97 publications

(102 citation statements)

References 16 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…This representation of epistemic state is more expressive than the one using total pre-orders on worlds, that is one of the canonical ones for classical AGM belief revision [12,3]. The fundamental role of OCF for defining belief revision operators is shown by the fact that Spohn's conditionalization of OCF [14] is often used to illustrate works on iterated belief revision [3,10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Using Transfinite Ordinal Conditional Functions

Konieczny

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this framework has never been studied. This paper opens this way. We study generalisations of transmutations operators to transfinite ordinals. Using transfinite ordinals allows to represent different "levels of beliefs", that naturally appear in real applications. This can be viewed as a generalisation of the usual "two levels of beliefs" framework: knowledge versus beliefs; or rules base versus facts base, issued from expert systems works.

show abstract

Section: Introductionmentioning

confidence: 99%

“…[14,16,3,10,13]). The intuitive appeal of the definition explains its success: an OCF is a function that maps worlds into ordinals.…”

Section: Introductionmentioning

confidence: 99%

Using Transfinite Ordinal Conditional Functions

Konieczny

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…is crucial: without it the lemma is not true. 24 Denote by REF the strengthening of REF weak obtained by dropping the clause B t 1 (!) \ I t 2 (!)…”

Section: Iterated Belief Revision In Branching-time Framesmentioning

confidence: 99%

Belief Change in Branching Time: AGM-consistency and Iterated Revision

Bonanno

2011

J Philos Logic

View full text Add to dashboard Cite

We study belief change in the branching-time structures introduced in [8]. First, we identify a property of branching-time frames that is equivalent (when the set of states is nite) to AGM-consistency, which is de ned as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision function that satis es the AGM postulates. Second, we provide a set of modal axioms that characterize the class of AGM-consistent frames within the modal logic introduced in [8]. Third, we introduce a generalization of AGM belief revision functions that allows a clear statement of principles of iterated belief revision and discuss iterated revision both semantically and syntactically.

show abstract

“…The Fluent Calculus [6][7], sensing action and the external action are introduced to the generating algorism of the CPNI net system, the generated CPNI net system can not only realize robot planning and also the dynamic knowledge of the robot reasoning.…”

Section: Introductionmentioning

confidence: 99%