Fetching the paper…
Reading the bibliography…
A central quest in explainable AI relates to understanding the decisions made by (learned) classifiers.
A. Garfinkel, “Forms of explanation: Rethinking the questions in social theory,” British Journal for the Philosophy of Science , vol. 33, no. 4, pp. 438–441, 1982
1982
Earlier work this paper cites.
R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers , vol. 35, no. 8, pp. 677–691, 1986
1986
Earlier work this paper cites.
D. Lewis, “Causal explanation,” in Philosophical Papers Vol. Ii , D. Lewis, Ed. Oxford University Press, 1986, pp. 214–240
1986
Earlier work this paper cites.
D. Temple, “The contrast theory of why-questions,” Philosophy of Science , vol. 55, no. 1, pp. 141–151, 1988
1988
Earlier work this paper cites.
P. Lipton, “Contrastive explanation,” Royal Institute of Philosophy Supplements , vol. 27, p. 247–266, 1990
1990
Earlier work this paper cites.
V. Gurvich and L. Khachiyan, “On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions,” Discrete Applied Mathematics , vol. 96, pp. 363–373, 1999
1999
Earlier work this paper cites.
A. Darwiche, “Decomposable negation normal form,” J. ACM , vol. 48, no. 4, pp. 608–647, 2001
2001
Earlier work this paper cites.
A. Darwiche and P. Marquis, “A knowledge compilation map,” J. Artif. Intell. Res. , vol. 17, pp. 229–264, 2002
2002
Earlier work this paper cites.
H. Chan and A. Darwiche, “Reasoning about Bayesian network classifiers,” in UAI . Morgan Kaufmann, 2003, pp. 107–115
2003
Earlier work this paper cites.
H. Chan and A. Darwiche, “Reasoning about bayesian network classifiers,” in UAI . Morgan Kaufmann, 2003, pp. 107–115
2003
Earlier work this paper cites.
Y. Crama and P. L. Hammer, “Boolean functions - theory, algorithms, and applications,” in Encyclopedia of mathematics and its applications , 2011
2011
Earlier work this paper cites.
A. Darwiche, “SDD: A new canonical representation of propositional knowledge bases,” in IJCAI . IJCAI/AAAI, 2011, pp. 819–826
2011
Earlier work this paper cites.
P. Beame, J. Li, S. Roy, and D. Suciu, “Lower bounds for exact model counting and applications in probabilistic databases,” in UAI . AUAI Press, 2013
2013
Earlier work this paper cites.
P. Beame and V. Liew, “New limits for knowledge compilation and applications to exact model counting,” in UAI . AUAI Press, 2015, pp. 131–140
2015
Earlier work this paper cites.
M. T. Ribeiro, S. Singh, and C. Guestrin, “”Why should I trust you?”: Explaining the predictions of any classifier,” in KDD . ACM, 2016, pp. 1135–1144
2016
Earlier work this paper cites.
S. Bova, “SDDs are exponentially more succinct than obdds,” in AAAI . AAAI Press, 2016, pp. 929–935
2016
Earlier work this paper cites.
A. Shih, A. Choi, and A. Darwiche, “A symbolic approach to explaining bayesian network classifiers,” in IJCAI . ijcai.org, 2018, pp. 5103–5111
2018
Earlier work this paper cites.
S. Wachter, B. D. Mittelstadt, and C. Russell, “Counterfactual explanations without opening the black box: Automated decisions and the GDPR,” Harvard Journal of Law & Technology , vol. 31, no. 2, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
N. Narodytska, S. P. Kasiviswanathan, L. Ryzhyk, M. Sagiv, and T. Walsh, “Verifying properties of binarized deep neural networks,” in AAAI . AAAI Press, 2018, pp. 6615–6624
2018
Earlier work this paper cites.
——, “Anchors: High-precision model-agnostic explanations,” in AAAI . AAAI Press, 2018, pp. 1527–1535
2018
Earlier work this paper cites.
A. Ignatiev, N. Narodytska, and J. Marques-Silva, “Abduction-based explanations for machine learning models,” in Proceedings of the Thirty-Third Conference on Artificial Intelligence (AAAI) , 2019, pp. 1511–1519
2019
Cited alongside, same era.
T. Miller, “Explanation in artificial intelligence: Insights from the social sciences,” Artif. Intell. , vol. 267, pp. 1–38, 2019
2019
Cited alongside, same era.
B. Mittelstadt, C. Russell, and S. Wachter, “Explaining explanations in AI,” Proceedings of the Conference on Fairness, Accountability, and Transparency , Jan 2019
2019
Cited alongside, same era.
Y. Goyal, Z. Wu, J. Ernst, D. Batra, D. Parikh, and S. Lee, “Counterfactual visual explanations,” in Proceedings of the 36th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, K. Chaudhuri and R. Salakhutdinov, Eds., vol. 97. PMLR, 09–15 Jun 2019, pp. 2376–2384
2019
Cited alongside, same era.
J. Marques-Silva, T. Gerspacher, M. C. Cooper, A. Ignatiev, and N. Narodytska, “Explaining naive bayes and other linear classifiers with polynomial time and delay,” in NeurIPS , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
P. Barceló, M. Monet, J. Pérez, and B. Subercaseaux, “Model interpretability through the lens of computational complexity,” in NeurIPS , 2020
2020
Later among the works it cites.
G. Audemard, F. Koriche, and P. Marquis, “On Tractable XAI Queries based on Compiled Representations,” in Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning , 9 2020, pp. 838–849
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Shih, A. Choi, and A. Darwiche, “Compiling bayesian network classifiers into decision graphs,” in AAAI . AAAI Press, 2019, pp. 7966–7974
2019
Cited alongside, same era.
N. Narodytska, A. A. Shrotri, K. S. Meel, A. Ignatiev, and J. Marques-Silva, “Assessing heuristic machine learning explanations with model counting,” in SAT , ser. Lecture Notes in Computer Science, vol. 11628. Springer, 2019, pp. 267–278
2019
Cited alongside, same era.
T. Baluta, S. Shen, S. Shinde, K. S. Meel, and P. Saxena, “Quantitative verification of neural networks and its security applications,” in CCS . ACM, 2019, pp. 1249–1264
2019
Cited alongside, same era.
A. Shih, A. Darwiche, and A. Choi, “Verifying binarized neural networks by angluin-style learning,” in SAT , ser. Lecture Notes in Computer Science, vol. 11628. Springer, 2019, pp. 354–370
2019
Cited alongside, same era.
2019
Cited alongside, same era.
B. Bollig and M. Buttkus, “On the relative succinctness of sentential decision diagrams,” Theory Comput. Syst. , vol. 63, no. 6, pp. 1250–1277, 2019
2019
Cited alongside, same era.
2020
Cited alongside, same era.
2020
Cited alongside, same era.
A. Darwiche and P. Marquis, “On quantifying literals in Boolean logic and its applications to explainable AI,” J. Artif. Intell. Res. , vol. 72, pp. 285–328, 2021
2021
Later among the works it cites.
Y. Zhang, Z. Zhao, G. Chen, F. Song, and T. Chen, “BDD4BNN: A BDD-based quantitative analysis framework for binarized neural networks,” in Computer Aided Verification , A. Silva and K. R. M. Leino, Eds. Cham: Springer International Publishing, 2021, pp. 175–200
2021
Later among the works it cites.
T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in AAAI . AAAI Press, 2021, pp. 3787–3795
2021
Later among the works it cites.
X. Huang, Y. Izza, A. Ignatiev, and J. Marques-Silva, “On efficiently explaining graph-based classifiers,” in KR , 2021, pp. 356–367
2021
Later among the works it cites.
2021
Later among the works it cites.
G. Audemard, S. Bellart, L. Bounia, F. Koriche, J. Lagniez, and P. Marquis, “On the computational intelligibility of Boolean classifiers,” in KR , 2021, pp. 74–86
2021
Later among the works it cites.
Y. Izza and J. Marques-Silva, “On explaining random forests with SAT,” in IJCAI . ijcai.org, 2021, pp. 2584–2591
2021
Later among the works it cites.
A. Darwiche and C. Ji, “On the computation of necessary and sufficient explanations,” in AAAI . AAAI Press, 2022
2022
Later among the works it cites.
S. Verma, V. Boonsanong, M. Hoang, K. E. Hines, J. P. Dickerson, and C. Shah, “Counterfactual explanations and algorithmic recourses for machine learning: A review,” 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
G. Audemard, S. Bellart, L. Bounia, F. Koriche, J.-M. Lagniez, and P. Marquis, “On the explanatory power of boolean decision trees,” Data & Knowledge Engineering , vol. 142, p. 102088, 2022
2022
Later among the works it cites.
G. Audemard, S. Bellart, L. Bounia, F. Koriche, J. Lagniez, and P. Marquis, “Trading complexity for sparsity in random forest explanations,” in AAAI . AAAI Press, 2022, pp. 5461–5469
2022
Later among the works it cites.
A. Ignatiev, Y. Izza, P. J. Stuckey, and J. Marques-Silva, “Using maxsat for efficient explanations of tree ensembles,” in AAAI . AAAI Press, 2022, pp. 3776–3785
2022
Later among the works it cites.
Y. Izza, A. Ignatiev, and J. Marques-Silva, “On tackling explanation redundancy in decision trees,” J. Artif. Intell. Res. , vol. 75, pp. 261–321, 2022
2022
Later among the works it cites.
Y. Zhang, Z. Zhao, G. Chen, F. Song, M. Zhang, T. Chen, and J. Sun, “QVIP: An ilp-based formal verification approach for quantized neural networks,” ser. ASE ’22. New York, NY, USA: Association for Computing Machinery, 2023
2023
Closest in time.
G. Audemard, J. Lagniez, P. Marquis, and N. Szczepanski, “Computing abductive explanations for boosted trees,” ser. Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS), vol. 206. PMLR, 2023
2023
Closest in time.