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 条
  • [11] THE COMPLEXITY OF OPTIMIZATION PROBLEMS
    KRENTEL, MW
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (03) : 490 - 509
  • [12] LEHMANN D, 1995, P IJCAI 95, P1543
  • [13] Liberatore P, 1996, PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, P556
  • [14] LIBERATORE P, 1995, P IJCAI 95, P1557
  • [15] NEBEL B, 1991, PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P417
  • [16] NEBEL B, 1994, P 11 EUR C ART INT E, P341
  • [17] WILLIAMS MA, 1994, MOR KAUF R, P619
12