• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xu Yini, Ouyang Dantong, Liu Meng, Zhang Liming, Zhang Yonggang. Algorithm of Computing Minimal Conflict Sets Based on the Structural Feature of Fault Output[J]. Journal of Computer Research and Development, 2018, 55(11): 2386-2394. DOI: 10.7544/issn1000-1239.2018.20170381
Citation: Xu Yini, Ouyang Dantong, Liu Meng, Zhang Liming, Zhang Yonggang. Algorithm of Computing Minimal Conflict Sets Based on the Structural Feature of Fault Output[J]. Journal of Computer Research and Development, 2018, 55(11): 2386-2394. DOI: 10.7544/issn1000-1239.2018.20170381

Algorithm of Computing Minimal Conflict Sets Based on the Structural Feature of Fault Output

More Information
  • Published Date: October 31, 2018
  • Model-based diagnosis is an important research in the field of artificial intelligence, and the diagnosis based on minimal conflict is a classical method to solve the problem of diagnosis. Therefore computing minimal conflict is an important step in model-based diagnosis. After studying the characteristics of the circuit model, this paper proposes an algorithm of computing minimal conflict sets based on the structural feature of fault output (MCS-SFFO) based on the CSRDSE algorithm. Firstly, the pruning rule of CSRDSE algorithm is improved, and it avoids the access to child leaf nodes of leaf nodes which are not conflict sets. Secondly, the concepts of component set independent of fault output and related to fault output are presented, and the method of computing component set independent of fault output is provided according to the system description and observation. Finally, a theorem about non-conflict set is proposed, that is, the component set independent of fault output and its subset are not conflict sets. MCS-SFFO algorithm that computes minimal conflict set is presented according to the non-conflict set theorem. Compared with CSRDSE algorithm, MCS-SFFO algorithm further prunes the non-solution space and reduces the number of calls to the SAT solver. Experimental evidence indicates that MCS-SFFO algorithm has better computational efficiency than CSRDSE algorithm.
  • Related Articles

    [1]Zhang Li, Wang Yisong, Xie Zhongtao, Feng Renyan. Computing Propositional Minimal Models: MiniSAT-Based Approaches[J]. Journal of Computer Research and Development, 2021, 58(11): 2515-2523. DOI: 10.7544/issn1000-1239.2021.20200370
    [2]Ouyang Dantong, Gao Han, Xu Yini, Zhang Liming. Minimal Conflict Set Solving Method Combined with Fault Logic Relationship[J]. Journal of Computer Research and Development, 2020, 57(7): 1472-1480. DOI: 10.7544/issn1000-1239.2020.20190338
    [3]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [4]Ouyang Dantong, Zhi Huayun, Liu Bowen, Zhang Liming, Zhang Yonggang. A Method of Computing Minimal Diagnoses Based on Pseudo-Failure-Degree to Create New Enumeration Tree[J]. Journal of Computer Research and Development, 2018, 55(4): 782-790. DOI: 10.7544/issn1000-1239.2018.20170016
    [5]Ouyang Dantong, Zhou Jianhua, Liu Bowen, Zhang Liming. A New Algorithm Combining with the Characteristic of the Problem for Model-Based Diagnosis[J]. Journal of Computer Research and Development, 2017, 54(3): 502-513. DOI: 10.7544/issn1000-1239.2017.20150952
    [6]Liu Siguang, Ouyang Dantong, Wang Yiyuan, Jia Fengyu, Zhang Liming. Algorithm of Computing Minimal Hitting Set Based on the Structural Feature of SE-Tree[J]. Journal of Computer Research and Development, 2016, 53(11): 2556-2566. DOI: 10.7544/issn1000-1239.2016.20150396
    [7]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [8]Zhang Liming, Ouyang Dantong, and Zeng Hailin. Computing the Minimal Hitting Sets Based on Dynamic Maximum Degree[J]. Journal of Computer Research and Development, 2011, 48(2): 209-215.
    [9]Wu Xiaopei, Ye Zhongfu, Guo Xiaojing, Zhang Daoxin, Hu Renjun. Independent Component Analysis Based on Sliding Window[J]. Journal of Computer Research and Development, 2007, 44(1): 185-191.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.
  • Cited by

    Periodical cited type(1)

    1. 欧阳丹彤,高菡,徐旖旎,张立明. 结合故障逻辑关系的极小冲突集求解方法. 计算机研究与发展. 2020(07): 1472-1480 . 本站查看

    Other cited types(2)

Catalog

    Article views (1010) PDF downloads (370) Cited by(3)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return