Representing belief revision through default theories

被引:0
|
作者
da Silva, JCP
Veloso, SRM
机构
[1] Univ Fed Rio de Janeiro, Inst Matemat, Dept Ciencia Comp, BR-21945970 Rio De Janeiro, Brazil
[2] Univ Fed Rio de Janeiro, COPPE, Programa Engn Sistemas & Comp, BR-21945970 Rio De Janeiro, Brazil
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We examine the representations of epistemic states and their revision processes (RP) through default theories (DTs). Using a sphere-based semantics for DTs we characterize a RP as a sequence of consistent expansions without using contractions. We show that DTs provide an unifying framework for revision in both semantical and syntactical-based approaches as well as in coherent and foundation approaches. Motivated by Nebel's work, we propose to extend the use of default theories in two directions: (i) using super-normal default theories to represent semantical classified revision processes; (ii) using general default theories and some variants of Reiter's default logics to represent foundation classified revision processes. We define revision operators, which can be viewed as a revision on the epistemic states, represented by a DT T, by a sentence alpha. Basically, they are defined via some operations on the class of the extensions of a default theory T' obtained from T and alpha.
引用
收藏
页码:227 / 235
页数:9
相关论文
共 50 条
  • [21] The Role of Alternative Theories and Anomalous Evidence in Children's Scientific Belief Revision
    Ganea, Patricia A.
    Larsen, Nicole E.
    Venkadasalam, Vaunam P.
    CHILD DEVELOPMENT, 2021, 92 (03) : 1137 - 1153
  • [22] Belief revision through the belief-function formalism in a multi-agent environment
    Istituto di Informatica, Universith di Ancona, Via Brecce Bianche, Ancona
    60131, Italy
    Lect. Notes Comput. Sci., (103-115):
  • [23] Belief functions and default reasoning
    Benferhat, S
    Saffiotti, A
    Smets, P
    ARTIFICIAL INTELLIGENCE, 2000, 122 (1-2) : 1 - 69
  • [24] Stratified default theories
    Cholewinski, P
    COMPUTER SCIENCE LOGIC, 1995, 933 : 456 - 470
  • [25] ASSERTIONAL DEFAULT THEORIES
    BREWKA, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 548 : 120 - 124
  • [26] Social Default Theories
    Sakama, Chiaki
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2009, 5753 : 470 - 476
  • [27] Revising default theories
    Antoniou, G
    Williams, MA
    TENTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 423 - 430
  • [28] REPRESENTING KNOWLEDGE WITH THEORIES ABOUT THEORIES
    STABLER, EP
    JOURNAL OF LOGIC PROGRAMMING, 1990, 9 (01): : 105 - 138
  • [29] Revocable Belief Revision
    van Ditmarsch, Hans
    STUDIA LOGICA, 2013, 101 (06) : 1185 - 1214
  • [30] Iterated Belief Revision
    Robert Stalnaker
    Erkenntnis, 2009, 70 : 189 - 209