Abstract
Model-based Diagnosis (MBD) with multiple observations is a currently complicated problem with many applications and solving this problem is attracting more and more attention. This paper propose an improved algorithm, called Improved implicit Hitting Set Dualization (IHSD), which is the integration of gate domination in recent works for computing cardinality-minimal aggregated diagnoses in MBD problems. First, our approach works by separating components into dominated components and non-dominated components according to structure of diagnosis system. The separated components are modelled as hard clauses and soft clauses separately. Additionally, two feasible approaches, called IHSDa and IHSDb, are proposed to expand one cardinality-minimal aggregated diagnosis to more diagnoses. Experimental results on 74XXX and ISCAS85 benchmarks clearly show that IHSD algorithm improves HSD, DC and DC*. Moreover, IHSDa and IHSDb outperform HSD on solving more diagnoses.
Similar content being viewed by others
References
Reiter R (1987) A theory of diagnosis from first principles. Artif Intell 32(1):57–95
Feldman A, Provan GM, Van Gemund AJC (2008) Computing minimal diagnoses by greedy stochastic search. Proceedings of the Twenty-second AAAI Conference on Artificial Intelligence 8:911–918
Siddiqi SA, Huang J (2007) Hierarchical diagnosis of multiple faults. Proceedings of the sixteenth international joint conference on artificial intelligence, pp 581–586
Jannach D, Schmitz T, Shchekotykhin KM (2015) Parallelized hitting set computation for model-based diagnosis. Proceedings of the Twenty-ninth AAAI Conference on Artificial Intelligence 15:1503–1510
Ansótegui C, Bonet ML, Levy J (2013) SAT-based MaxSAT algorithms. Artif Intell 196:77–105
Feldman A, Provan G, de Kleer J, et al. (2010) Solving model-based diagnosis problems with Max-SAT solvers and vice versa. Proceedings of the twenty-first international workshop on principles of diagnosis (DX-10): 185–192
Stern RT, Kalech M, Feldman A, et al. (2012) Exploring the duality in conflict-directed model-based diagnosis. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence: 828–834
Williams BC, Ragno RJ (2007) Conflict-directed A* and its role in model-based embedded systems. Discret Appl Math 155(12):1562–159
Darwiche A (2001) Decomposable negation normal form. Journal of the ACM (JACM) 48 (4):608–647
Metodi A, Stern R, Kalech M, et al. (2012) Compiling model-based diagnosis to Boolean satisfaction. Proceedings of the Twenty-Sixth AAAI conference on artificial intelligence, pp 793–799
Liu M, Ouyang D, Cai S, et al. (2018) Efficient zonal diagnosis with maximum satisfiability. Science China Information Sciences 61(11):17–30
Mencía C, Previti A, Marques-Silva J (2015) Literal-based MCS extraction. Proceedings of the twenty-fourth international joint conference on artificial intelligence, pp 1973–1979
Ignatiev A, Morgado A, Marques-Silva J (2019) RC2: An efficient MaxSAT solver. Journal on Satisfiability, Boolean Modeling and Computation 11(1):53–64
Greiner R, Smith BA, Wilkerson RW (1989) A correction to the algorithm in Reiter’s theory of diagnosis. Artif Intell 41(1):79–88
Metodi A, Stern R, Kalech M, et al. (2014) A novel sat-based approach to model based diagnosis. J Artif Intell Res 51:377–411
de Kleer J (2011) Hitting set algorithms for model-based diagnosis. Proceedings of the twenty-second international workshop on priciples of diagnosis
Diedrich A, Feldman A, Perdomo-Ortiz A, et al. (2016) Applying simulated annealing to problems in model-based diagnosis. Proceedings of the twenty-seventh international workshop on principles of diagnosis
Feldman A, Provan G, Van Gemund A (2010) Approximate model-based diagnosis using greedy stochastic search. J Artif Intell Res 38:371–413
Feldman A, Provan G, Van Gemund A (2010) A model-based active testing approach to sequential diagnosis. J Artif Intell Res 39:301–334
Marques-Silva J, Janota M, Ignatiev A, Morgado A (2015) Efficient model based diagnosis with maximum satisfiability. Proceedings of the twenty-fourth international joint conference on artificial intelligence, pp 1966–1972
Lamraoui S, Nakajima S (2014) A formula-based approach for automatic fault localization of imperative programs. In: ICFEM, pp 251–266
Lamraoui S, Nakajima S (2016) A formula-based approach for automatic fault localization of multi-fault programs. JIP 24(1):88–98
Ignatiev A, Morgado A, Weissenbacher G, et al. (2019) Model-based diagnosis with multiple observations. Proceedings of the twenty-eighth international joint conference on artificial intelligence, pp 1108–1115
Ignatiev A, Morgado A, Marques-Silva J (2017) Model based diagnosis of multiple observations with implicit hitting sets. arXiv:1707.01972
Lei Z, Cai S (2018) Solving (weighted) partial MaxSAT by dynamic local search for SAT. Proceedings of the twenty-seventh international joint conference on artificial intelligence, pp 1346–1352
Marques-Silva J, Lynce I, Malik S (2009) Conflict-driven clause learning SAT solvers. Handbook of satisfiability, pp 131–153
Fujiwara H, Shimono T (1983) On the acceleration of test generation algorithms. IEEE Comput Archit Lett 32(12):1137–1144
Kirkland T, Mercer MR (1987) A Topological Search Algorithm for ATPG. Proceeding of the twenty-forth ACM/IEEE design automation conference, pp 502–508
Acknowledgements
This work was supported by the National Natural Science Foundation China (62076108, 61872159, 61672261).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhou, H., Ouyang, D., Zhang, L. et al. Model-based diagnosis with improved implicit hitting set dualization. Appl Intell 52, 2111–2118 (2022). https://doi.org/10.1007/s10489-021-02408-0
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-021-02408-0