Abstract: For the sake of keeping minimal change principle, firstly, the forgetting contraction operator was defined based on forgetting theory, and this contraction operator could satisfy the necessity AGM contraction postulates. Then the forgetting revision operator was built through Levi Identity. Finally, the forgetting revision method and multiple forgetting revision algorithm were proposed. The case study shows that the algorithm is feasible and effective, and it can achieve a satisfied amendment.

Key words: belief revision, partial meet contraction, contraction, revision, forgetting theory

摘要： 为了使信念修正能够满足最小改变原则，首先基于遗忘理论定义遗忘收缩算子，并且证明该算子满足必要AGM收缩假定；然后通过Levi Identity构建遗忘修正算子；最后给出遗忘修正方法和多次遗忘修正算法。实例分析表明,算法具有可行性和有效性，能够得到较满意的修正结果。

关键词: 信念修正, 部分相交收缩, 收缩, 修正, 遗忘理论