Page 316 - 《软件学报》2025年第7期

赵相福 等: BWSS: 结合可疑集合簇计算极小碰集的 Boolean 算法 3237

References:
[1] Reiter R. A theory of diagnosis from first principles. Artificial Intelligence, 1987, 32(1): 57–95. [doi: 10.1016/0004-3702(87)90062-2]
[2] Zhao XF, Ouyang DT. Deriving all minimal conflict sets using satisfiability algorithms. Acta Electronica Sinica, 2009, 37(4): 804–810 (in
Chinese with English abstract). [doi: 10.3321/j.issn:0372-2112.2009.04.024]
[3] Metodi A, Stern R, Kalech M, Codish M. A novel SAT-based approach to model based diagnosis. Journal of Artificial Intelligence
Research, 2014, 51: 377–411. [doi: 10.1613/jair.4503]
[4] Greiner R, Smith BA, Wilkerson RW. A correction to the algorithm in Reiter’s theory of diagnosis. Artificial Intelligence, 1989, 41(1):
79–88. [doi: 10.1016/0004-3702(89)90079-9]
[5] Wotawa F. A variant of Reiter’s hitting-set algorithm. Information Processing Letters, 2001, 79(1): 45–51. [doi: 10.1016/s0020-0190(00)
00166-6]
[6] Jiang YF, Lin L. The computation of hitting sets with Boolean formulas. Chinese Journal of Computers, 2003, 26(8): 919–924 (in
Chinese with English abstract). [doi: 10.3321/j.issn:0254-4164.2003.08.004]
[7] Wang RQ, Ouyang DT, Wang YY, Liu SG, Zhang LM. Solving minimal hitting sets method with SAT based on DOEC minimization.
Journal of Computer Research and Development, 2018, 55(6): 1273–1281 (in Chinese with English abstract). [doi: 10.7544/issn1000-
1239.2018.20160809]
[8] Gainer-Dewar A, Vera-Licona P. The minimal hitting set generation problem: Algorithms and computation. SIAM Journal on Discrete
Mathematics, 2017, 31(1): 63–100. [doi: 10.1137/15M1055024]
[9] Abreu R, van Gemund A. A low-cost approximate minimal hitting set algorithm and its application to model-based diagnosis. In: Proc. of
the 8th Symp. on Abstraction Reformulation and Approximation. Lake Arrowhead: AAAI, 2009. 2–9.
2
[10] Cardoso N, Abreu R. MHS : A map-reduce heuristic-driven minimal hitting set search algorithm. In: Proc. of the Int’l Conf. on Multicore
Software Engineering, Performance, and Tools. Saint Petersburg: Springer, 2013. 25–36. [doi: 10.1007/978-3-642-39955-8_3]
[11] Jannach D, Schmitz T, Shchekotykhin K. Parallelized hitting set computation for model-based diagnosis. In: Proc. of the 29th AAAI
Conf. on Artificial Intelligence. Austin: AAAI, 2015. 1503–1510. [doi: 10.1609/aaai.v29i1.9389]
[12] Pill I, Quaritsch T. Optimizations for the Boolean approach to computing minimal hitting sets. In: Proc. of the 20th European Conf. on
Artificial Intelligence. Montpellier: IOS Press, 2012. 648–653. [doi: 10.3233/978-1-61499-098-7-648]
[13] Huang S, Zhao XF, Tong XR. An incremental Boolean algorithm for computing minimal hitting sets. In: Proc. of the 13th Int’l Congress
on Image and Signal Processing, BioMedical Engineering and Informatics. Chengdu: IEEE, 2020. 56–59. [doi: 10.1109/CISP-
BMEI51763.2020.9263682]
[14] Deng ZY, Ouyang DT, Geng XN, Liu J. Computing the minimal hitting sets with dynamic maximum element coverage value. Journal of
Computer Research and Development, 2018, 55(4): 791–801 (in Chinese with English abstract). [doi: 10.7544/ISSN1000-1239.2018.
20160900]
[15] Liu SG, Ouyang DT, Zhang LM. Method of minimality-checking of candidate solution for minimal hitting set algorithm. Ruan Jian Xue
Bao/Journal of Software, 2018, 29(12): 3733–3746 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5311.htm [doi:
10.13328/j.cnki.jos.005311]
[16] Wang QJ, Jin T, Wang MQ. A hierarchical minimum hitting set calculation method for multiple multiphase faults in power distribution
networks. IEEE Trans. on Industrial Electronics, 2021, 68(1): 4–14. [doi: 10.1109/tie.2020.2967691]
[17] Zhao XF, Tong XR, Ouyang DT, Zhang LM, Hou YZ. TreeMerge: Efficient generation of minimal hitting-sets for conflict sets in tree
structure for model-based fault diagnosis. IEEE Trans. on Reliability, 2021, 70(4): 1596–1610. [doi: 10.1109/TR.2021.3115130]
[18] Chen XM, Meng XF, Qiao RX. Method of computing all minimal hitting set based on BNB-HSSE. Chinese Journal of Scientific
Instrument, 2010, 31(1): 61–67 (in Chinese with English abstract). [doi: 10.19650/j.cnki.cjsi.2010.01.011]
[19] Huang J, Chen L, Zou P. A compounded genetic and simulated annealing algorithm for computing minimal diagnosis. Ruan Jian Xue
Bao/Journal of Software, 2004, 15(9): 1345–1350 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/15/1345.htm
[20] Kurtoglu T, Narasimhan S, Poll S, Garcia D, Kuhn L, Dekleer J, van Gemund A, Feldman A. First international diagnosis
competition—DXC’09. In: Proc. of the 20th Int’l Workshop on Principles of Diagnosis. 2009. 383–396.

附中文参考文献:
[2] 赵相福, 欧阳丹彤. 使用 SAT 求解器产生所有极小冲突部件集. 电子学报, 2009, 37(4): 804–810. [doi: 10.3321/j.issn:0372-2112.
2009.04.024]
[6] 姜云飞, 林笠. 用布尔代数方法计算最小碰集. 计算机学报, 2003, 26(8): 919–924. [doi: 10.3321/j.issn:0254-4164.2003.08.004]