The complexity of iterated belief revision

被引：0
作者：
Liberatore, P [1 ]
机构：
[1] Univ Roma La Sapienza, Dipartimento Informat & Sistemist, I-00198 Rome, Italy
来源：
DATABASE THEORY - ICDT'97 | 1997年 / 1186卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we analyze the complexity of revising a knowledge base when an iteration of this process is necessary. The analysis concerns both the classical problems of belief revision (inference, model checking, computation of the new base) and new issues, related to the problem of "committing" the changes.
引用
收藏
页码：276 / 290
页数：15
相关论文
共 17 条
  • [1] ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS
    ALCHOURRON, CE
    GARDENFORS, P
    MAKINSON, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) : 510 - 530
  • [2] [Anonymous], HDB THEORETICAL COMP
  • [3] BOUTILIER, 1993, P IJCAI 93, P519
  • [4] Cadoli M., 1995, Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. PODS 1995, P151, DOI 10.1145/212433.220205
  • [5] Dalal M., 1988, P AAAI, P449
  • [6] ON THE COMPLEXITY OF PROPOSITIONAL KNOWLEDGE BASE REVISION, UPDATES, AND COUNTERFACTUALS
    EITER, T
    GOTTLOB, G
    [J]. ARTIFICIAL INTELLIGENCE, 1992, 57 (2-3) : 227 - 270
  • [7] EITER T, 1993, P IJCAI 93, P526
  • [8] FRIEDMAN N, 1994, MOR KAUF R, P190
  • [9] GRAHNE G, 1995, INFORMATION COMPUTAT, V2, P241
  • [10] PROPOSITIONAL KNOWLEDGE BASE REVISION AND MINIMAL CHANGE
    KATSUNO, H
    MENDELZON, AO
    [J]. ARTIFICIAL INTELLIGENCE, 1991, 52 (03) : 263 - 294
12