• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (11): 127-130.

• 论文 • 上一篇    下一篇

一种基于ATMS的求解所有极小冲突集的新方法

张立明[1,2] 欧阳丹彤[1,2] 赵相福[1,2]   

  • 出版日期:2007-11-01 发布日期:2010-05-30

  • Online:2007-11-01 Published:2010-05-30

摘要:

在Reiter算法的基础上,本文提出一种基于ATMS的求解所有极小冲突集的新方法。其中,对每个元件模型最多调用一次就可求出所有的极小冲突集,防止了ATMS的多次调用,因而能够提高效率。本文提出了极小依赖集的概念,并据此对ATMS求得的极小冲突集进行了分类;分析了算法的复杂度,并将新方法与相关工作进行了比较。该算法程序容 易编制,而且效率高。

关键词: 基于模型的诊断 极小冲突集 ATMS

Abstract:

A new method for deriving all minimal conflict sets based on ATMS is proposed in this paper. All minimal conflict sets can be derived with every compo  nent model calculated at most once, thus ATMS is avoided to be called more frequently, and the efficiency is improved as well. A concept of minimal depe  ndence set is put forward, as a result of which, all minimal conflict sets based on ATMS can be sorted by two classes. Then, the complexity is analyzed.Finally, the related methods for deriving all conflict sets are compared with the method. The program is easy-to-implement and efficient.

Key words: (model-based diagnosis;minimal conflict set;ATMS)