An Efficient Approach for Computing Conflict Sets Combining Failure Probability with SAT
According to the topological structure of circuit and the characteristics of the enumeration tree, with the in-depth study of the reversed depth set enumeration tree method to compute conflict sets (CSRDSE), an efficient approach for counting conflict sets combining failure probability with SAT (CSCFPS) is proposed. Firstly, this paper presents the concept of fault output component set, possible fault component set, non-fault component set, explained fault component set, failure probability and non-conflict set theorem. Secondly, the OrderedCS-FP algorithm is came up. This algorithm calculates an ordered component set where the components are organized in descending order of failure probability. Finally, this paper puts forward the CSCFPS algorithm. In this algorithm, the SE-Tree is generated on the basis of the ordered component set, so minimal conflict set can be visited as early as possible to avoid the access to redundant nodes. On the grounds of the non-conflict set theorem, the sub-tree corresponding to the non-fault component set is deleted, decreasing the traversal to these nodes. Thus, the number of calling the SAT solver is greatly lessened. The experimental results show that the efficiency of this method is significantly improved.
KeywordsModel-based diagnosis Satisfiability (SAT) Set enumeration tree (SE-tree) Conflict set Failure probability
This work was supported by the National Natural Science Foundation of China (61672261, 61502199, 61402196, 61373052).
- 1.Cai, S., Su, K.: Configuration checking with aspiration in local search for SAT. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 22–26 July 2012, Toronto, Ontario, Canada, pp. 434–440 (2012)Google Scholar
- 2.Console, L., Dressler, O.: Model-based diagnosis in the real world: lessons learned and challenges remaining. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, Stockholm, Sweden, 31 July–6 August 1999, vols. 2, 1450 p., pp. 1393–1400 (1999)Google Scholar
- 3.Dai, S., Sun, H.: Computing conflict sets for model-based diagnosis. Control Theory Appl. 20(4), 630–632 (2003)Google Scholar
- 4.Fang, M.: A practical method to identify the minimal conflict sets. J. Hefei Univ. Technol. 22(1), 39–43 (1999)Google Scholar
- 12.Luan, S., Dai, G.: Approach to diagnosing a system with structure information. Chin. J. Comput. 365, 178–189 (2005)Google Scholar
- 14.Ouyang, D., Liu, B., Zhou, J., Zhang, L.: A method of computing minimal conflict sets combining the structure property with the anti-depth SE-Tree. Acta Electron. Sin. 45(5), 1175–1181 (2017)Google Scholar
- 16.Wang, Y., Cai, S., Yin, M.: Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12–17 February 2016, Phoenix, Arizona, USA, pp. 805–811 (2016)Google Scholar
- 22.Zhao, X., Ouyang, D.: Deriving all minimal conflict sets using satisfiability algorithms. Acta Electron. Sin. 37(4), 804–810 (2009)Google Scholar