Back to Basics: Belief Revision Through Direct Selection

被引:1
|
作者
Hansson, Sven Ove [1 ]
机构
[1] Royal Inst Technol KTH, Stockholm, Sweden
关键词
Belief change; Select-and-intersect; Recovery; Expansion property; Finiteness; Ramsey test; Direct selection; Simplicity; Choice function; Selection function; Support function; General input assimilation; Descriptor revision; THEORY CONTRACTION; RAMSEY TEST; LOGIC; RECOVERY;
D O I
10.1007/s11225-018-9807-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Traditionally, belief change is modelled as the construction of a belief set that satisfies a success condition. The success condition is usually that a specified sentence should be believed (revision) or not believed (contraction). Furthermore, most models of belief change employ a select-and-intersect strategy. This means that a selection is made among primary objects that satisfy the success condition, and the intersection of the selected objects is taken as outcome of the operation. However, the select-and-intersect method is difficult to justify, in particular since the primary objects (usually possible worlds or remainders) are not themselves plausible outcome candidates. Some of the most controversial features of belief change theory, such as recovery and the impossibility of Ramsey test conditionals, are closely connected with the select-and-intersect method. It is proposed that a selection mechanism should instead operate directly on the potential outcomes, and select only one of them. In this way many of the problems that are associated with the select-and-intersect method can be avoided. This model is simpler than previous models in the important Ockhamist sense of doing away with intermediate, cognitively inaccessible objects. However, the role of simplicity as a choice criterion in the direct selection among potential outcomes is left as an open issue.
引用
收藏
页码:887 / 915
页数:29
相关论文
共 50 条
  • [1] Back to Basics: Belief Revision Through Direct Selection
    Sven Ove Hansson
    Studia Logica, 2019, 107 : 887 - 915
  • [2] A Kripke-Lewis semantics for belief update and belief revision
    Bonanno, Giacomo
    ARTIFICIAL INTELLIGENCE, 2025, 339
  • [3] Belief Selection through Argumentation
    Kaci, Souhila
    Salhi, Yakoub
    37TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, 2022, : 889 - 896
  • [4] Accommodative Belief Revision
    Eloranta, Satu
    Hakli, Raul
    Niinivaara, Olli
    Nykanen, Matti
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 180 - +
  • [5] On uniform belief revision
    Aravanis, Theofanis
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (07) : 1357 - 1376
  • [6] Belief revision and projection in the epistemic situation calculus
    Schwering, Christoph
    Lakemeyer, Gerhard
    Pagnucco, Maurice
    ARTIFICIAL INTELLIGENCE, 2017, 251 : 62 - 97
  • [7] Filtered Belief Revision: Syntax and Semantics
    Bonanno, Giacomo
    JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2022, 31 (04) : 645 - 675
  • [8] Theory-relational belief revision
    Aravanis, Theofanis
    Peppas, Pavlos
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2022, 90 (06) : 573 - 594
  • [9] A belief revision framework for revising epistemic states with partial epistemic states
    Ma, Jianbing
    Liu, Weiru
    Benferhat, Salem
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2015, 59 : 20 - 40
  • [10] Revocable Belief Revision
    van Ditmarsch, Hans
    STUDIA LOGICA, 2013, 101 (06) : 1185 - 1214