NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
An exploration of combinatorial testing-based approaches to fault localization for explainable AI
Published
Author(s)
Ludwig Kampel, Dimitris Simos, D. Richard Kuhn, Raghu N. Kacker
Abstract
We briefly review properties of explainable AI proposed by various researchers. We take a structural approach to the problem of explainable AI, examine the feasibility of these aspects and extend them where appropriate. Afterwards, we review combinatorial methods for explainable AI which are based on combinatorial testing-based approaches to fault localization. Last, we view the combinatorial methods for explainable AI through the lens provided by the properties of explainable AI that are elaborated in this work. We pose resulting research questions that need to be answered and point towards possible solutions, which involve a hypothesis about a potential parallel between software testing, human cognition and brain capacity.
Kampel, L.
, Simos, D.
, Kuhn, D.
and Kacker, R.
(2021),
An exploration of combinatorial testing-based approaches to fault localization for explainable AI, Annals of Mathematics and Artificial Intelligence, [online], https://doi.org/10.1007/s10472-021-09772-0
(Accessed October 15, 2025)