Fetching the paper…
Reading the bibliography…
The last decade witnessed an ever-increasing stream of successes in Machine Learning (ML).
Avellaneda, F.: Learning optimal decision trees from large datasets. CoRR abs/1904.06314
1904
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1910
Earlier work this paper cites.
Hartshorne, C., Weiss, P. (eds.): Collected Papers of Charles Sanders Peirce. Harvard University Press (1931)
1931
Earlier work this paper cites.
Hempel, C.G., Oppenheim, P.: Studies in the logic of explanation. Philosophy of science 15
1948
Earlier work this paper cites.
Miller, G.A.: The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological review 63
1956
Earlier work this paper cites.
Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7
1960
Earlier work this paper cites.
Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5
1962
Earlier work this paper cites.
TSEITIN, G.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic pp. 115–125 (1968)
1968
Earlier work this paper cites.
Cook, S.A.: The complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) STOC. pp. 151–158 (1971)
1971
Earlier work this paper cites.
Morgan, C.G.: Hypothesis generation by machine. Artif. Intell. 2
1971
Earlier work this paper cites.
Valiant, L.G.: A theory of the learnable. Commun. ACM 27
1972
Earlier work this paper cites.
Pople, H.E.: On the mechanization of abductive logic. In: IJCAI. pp. 147–152 (1973)
1973
Earlier work this paper cites.
Swartout, W.R.: A digitalis therapy advisor with explanations. In: IJCAI. pp. 819–825 (1977)
1977
Earlier work this paper cites.
Swartout, W.R.: XPLAIN: A system for creating and explaining expert consulting programs. Artif. Intell. 21
1983
Earlier work this paper cites.
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth (1984)
1984
Earlier work this paper cites.
Perrow, C.: Normal accidents: Living with high risk technologies. Basic books (1984)
1984
Earlier work this paper cites.
Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2
1986
Earlier work this paper cites.
Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1
1986
Earlier work this paper cites.
Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32
1987
Earlier work this paper cites.
Rivest, R.L.: Learning decision lists. Mach. Learn. 2
1987
Earlier work this paper cites.
Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. J. Comput. Syst. Sci. 37
1988
Earlier work this paper cites.
de Siqueira N., J.L., Puget, J.: Explanation-based generalisation of failures. In: ECAI. pp. 339–344 (1988)
1988
Earlier work this paper cites.
Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning 3
1989
Earlier work this paper cites.
Greiner, R., Smith, B.A., Wilkerson, R.W.: A correction to the algorithm in reiter’s theory of diagnosis. Artif. Intell. 41
1989
Earlier work this paper cites.
Shanahan, M.: Prediction is deduction but explanation is abduction. In: IJCAI. pp. 1055–1060 (1989)
1989
Earlier work this paper cites.
Friedrich, G., Gottlob, G., Nejdl, W.: Hypothesis classification, abductive diagnosis and therapy. In: ESE. pp. 69–78 (1990)
1990
Earlier work this paper cites.
Selman, B., Levesque, H.J.: Abductive and default reasoning: A computational core. In: AAAI. pp. 343–348 (1990)
1990
Earlier work this paper cites.
Bylander, T., Allemang, D., Tanner, M.C., Josephson, J.R.: The computational complexity of abduction. Artif. Intell. 49
1991
Earlier work this paper cites.
Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. INFORMS J. Comput. 3
1991
Earlier work this paper cites.
Marquis, P.: Extending abduction from propositional to first-order logic. In: FAIR. pp. 141–155 (1991)
1991
Earlier work this paper cites.
Oliver, J.J.: Decision graphs – an extension of decision trees. Tech. Rep. 92/173, Monash University (1992)
1992
Earlier work this paper cites.
Quinlan, J.R.: C4.5: programs for machine learning. Morgan-Kaufmann (1993)
1993
Earlier work this paper cites.
Murthy, S.K., Kasif, S., Salzberg, S.: A system for induction of oblique decision trees. J. Artif. Intell. Res. 2
1994
Earlier work this paper cites.
Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)
1994
Earlier work this paper cites.
Rymon, R.: An SE-tree-based prime implicant generation algorithm. Ann. Math. Artif. Intell. 11
1994
Earlier work this paper cites.
Brodley, C.E., Utgoff, P.E.: Multivariate decision trees. Mach. Learn. 19
1995
Earlier work this paper cites.
Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42
1995
Earlier work this paper cites.
Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24
1995
Earlier work this paper cites.
Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21
1996
Earlier work this paper cites.
Marques-Silva, J., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) ICCAD. pp. 220–227 (1996)
1996
Earlier work this paper cites.
Kavvadias, D.J., Stavropoulos, E.C.: Evaluation of an algorithm for the transversal hypergraph problem. In: WAE. pp. 72–84 (1999)
1999
Earlier work this paper cites.
Kleine Büning, H., Lettmann, T.: Propositional logic - deduction and algorithms, Cambridge tracts in theoretical computer science, vol. 48. Cambridge University Press (1999)
1999
Earlier work this paper cites.
Marques-Silva, J., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Computers 48
1999
Earlier work this paper cites.
Breiman, L.: Random forests. Mach. Learn. 45
2001
Earlier work this paper cites.
Breiman, L.: Statistical modeling: The two cultures. Statistical science 16
2001
Earlier work this paper cites.
Darwiche, A.: Decomposable negation normal form. J. ACM 48
2001
Earlier work this paper cites.
Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. J. Appl. Non Class. Logics 11
2001
Earlier work this paper cites.
Bixby, R.E.: Solving real-world linear programs: A decade and more of progress. Oper. Res. 50
2002
Earlier work this paper cites.
Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17
2002
Earlier work this paper cites.
Falappa, M.A., Kern-Isberner, G., Simari, G.R.: Explanations, belief revision and defeasible reasoning. Artif. Intell. 141
2002
Earlier work this paper cites.
Knight, J.C.: Safety critical systems: challenges and directions. In: ICSE. pp. 547–550 (2002)
2002
Earlier work this paper cites.
Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell. 15
2003
Earlier work this paper cites.
Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. In: ESA. pp. 556–567 (2003)
2003
Earlier work this paper cites.
Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: LICS. pp. 55–64 (2003)
2003
Earlier work this paper cites.
Pérez, R.P., Uzcátegui, C.: Preferences and explanations. Artif. Intell. 149
2003
Earlier work this paper cites.
Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development - Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series, Springer (2004), https://doi.org/10.1007/978-3-662-07964-5
2004
Earlier work this paper cites.
Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: AAAI. pp. 167–172 (2004)
2004
Earlier work this paper cites.
Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: PADL. pp. 174–186 (2005)
2005
Earlier work this paper cites.
Garfinkel, S.: History’s worst software bugs. https://www.wired.com/2005/11/historys-worst-software-bugs/ (2005)
2005
Earlier work this paper cites.
Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9
2005
Earlier work this paper cites.
Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: A new algorithm for the hypergraph transversal problem. In: COCOON. pp. 767–776 (2005)
2005
Earlier work this paper cites.
Umans, C., Villa, T., Sangiovanni-Vincentelli, A.L.: Complexity of two-level logic minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25
2005
Earlier work this paper cites.
Amgoud, L., Prade, H.: Explaining qualitative decision under uncertainty by argumentation. In: AAAI. pp. 219–224 (2006)
2006
Earlier work this paper cites.
Hachtel, G.D., Somenzi, F.: Logic synthesis and verification algorithms. Springer (2006), https://doi.org/10.1007/0-387-31005-3
2006
Earlier work this paper cites.
Khachiyan, L., Boros, E., Elbassioni, K.M., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discret. Appl. Math. 154
2006
Earlier work this paper cites.
Barker, C.: The top 10 IT disasters of all time. https://www.zdnet.com/article/the-top-10-it-disasters-of-all-time/ (2007)
2007
Earlier work this paper cites.
Bixby, R.E., Rothberg, E.: Progress in computational mixed integer programming - A look back from the other side of the tipping point. Ann. Oper. Res. 149
2007
Earlier work this paper cites.
Bradley, A.R., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer (2007)
2007
Earlier work this paper cites.
Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counterexamples to induction. In: FMCAD. pp. 173–180 (2007)
2007
Earlier work this paper cites.
Nijssen, S., Fromont, É.: Mining optimal decision trees from itemset lattices. In: KDD. pp. 530–539 (2007)
2007
Earlier work this paper cites.
Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. J. Applied Logic 7
2007
Earlier work this paper cites.
Amgoud, L., Serrurier, M.: Agents that argue and explain classifications. Auton. Agents Multi Agent Syst. 16
2008
Earlier work this paper cites.
Korovin, K.: iProver - an instantiation-based theorem prover for first-order logic (system description). In: IJCAR. pp. 292–298 (2008)
2008
Earlier work this paper cites.
Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reason. 40
2008
Earlier work this paper cites.
Tanner, L., and Jenny G H Low, M.S., Ong, A., Tolfvenstam, T., Lai, Y.L., Ng, L.C., Leo, Y.S., Puong, L.T., Vasudevan, S.G., Simmons, C.P., Hibberd, M.L., Ooi, E.E.: Decision tree algorithms predict the diagnosis and outcome of dengue fever in the early phase of illness. PLoS neglected tropical diseases 2
2008
Earlier work this paper cites.
Amgoud, L., Prade, H.: Using arguments for making and explaining decisions. Artif. Intell. 173
2009
Earlier work this paper cites.
Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009), http://www.cambridge.org/catalogue/catalogue.asp?isbn=9780521424264
2009
Earlier work this paper cites.
Bessiere, C., Hebrard, E., O’Sullivan, B.: Minimising decision tree size as combinatorial optimisation. In: CP. pp. 173–187 (2009)
2009
Earlier work this paper cites.
Bienvenu, M.: Prime implicates and prime implicants: From propositional to modal logic. J. Artif. Intell. Res. 36
2009
Earlier work this paper cites.
Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14
2009
Earlier work this paper cites.
Wu, X., Kumar, V. (eds.): The top ten algorithms in data mining. CRC press (2009)
2009
Earlier work this paper cites.
Darbari, A., Fischer, B., Marques-Silva, J.: Industrial-strength certified SAT solving through verified SAT proof checking. In: ICTAC. pp. 260–274 (2010)
2010
Earlier work this paper cites.
Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series, Springer (2010), https://doi.org/10.1007/978-3-642-16533-7
2010
Earlier work this paper cites.
Izza, Y., Ignatiev, A., Marques-Silva, J.: On explaining decision trees. CoRR abs/2010.11034
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
McConnell, R.M., Mehlhorn, K., Näher, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5
2010
Earlier work this paper cites.
Nair, V., Hinton, G.E.: Rectified linear units improve restricted boltzmann machines. In: ICML. pp. 807–814 (2010)
2010
Earlier work this paper cites.
Nijssen, S., Fromont, É.: Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov. 21
2010
Earlier work this paper cites.
Vardi, M.Y.: On P, NP, and computational complexity. Commun. ACM 53
2010
Earlier work this paper cites.
Alkassar, E., Böhme, S., Mehlhorn, K., Rizkallah, C.: Verification of certifying computations. In: CAV. pp. 67–82 (2011)
2011
Earlier work this paper cites.
Crama, Y., Hammer, P.L.: Boolean Functions - Theory, Algorithms, and Applications. Cambridge University Press (2011), http://www.cambridge.org/gb/knowledge/isbn/item6222210/?site_locale=en_GB
2011
Earlier work this paper cites.
Janota, M., Marques-Silva, J.: Abstraction-based algorithm for 2QBF. In: SAT. pp. 230–244 (2011)
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25
2012
Earlier work this paper cites.
Ben-Ari, M.: Mathematical Logic for Computer Science. Springer (2012), https://doi.org/10.1007/978-1-4471-4129-7
2012
Earlier work this paper cites.
Dillig, I., Dillig, T., McMillan, K.L., Aiken, A.: Minimum satisfying assignments for SMT. In: CAV. pp. 394–409 (2012)
2012
Earlier work this paper cites.
Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. AI EDAM 26
2012
Earlier work this paper cites.
Flach, P.A.: Machine Learning - The Art and Science of Algorithms that Make Sense of Data. CUP (2012)
2012
Earlier work this paper cites.
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers (2012)
2012
Earlier work this paper cites.
McQuaid, P.A.: Software disasters - understanding the past, to improve the future. J. Softw. Evol. Process. 24
2012
Earlier work this paper cites.
Morgado, A., Liffiton, M.H., Marques-Silva, J.: MaxSAT-based MCS enumeration. In: HVC. pp. 86–101 (2012)
2012
Earlier work this paper cites.
Adee, S.: Bad bugs: The worst disasters caused by software fails. https://www.newscientist.com/gallery/software-bugs/ (2013)
2013
Earlier work this paper cites.
Kovács, L., Voronkov, A.: First-order theorem proving and vampire. In: CAV. pp. 1–35 (2013)
2013
Earlier work this paper cites.
Liffiton, M.H., Malik, A.: Enumerating infeasibility: Finding multiple MUSes quickly. In: CPAIOR. pp. 160–175 (2013)
2013
Earlier work this paper cites.
Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: IJCAI. pp. 615–622 (2013)
2013
Earlier work this paper cites.
Marques-Silva, J., Janota, M., Belov, A.: Minimal sets over monotone predicates in boolean formulae. In: CAV. pp. 592–607 (2013)
2013
Earlier work this paper cites.
Morgado, A., Heras, F., Liffiton, M.H., Planes, J., Marques-Silva, J.: Iterative and core-guided maxsat solving: A survey and assessment. Constraints An Int. J. 18
2013
Earlier work this paper cites.
Previti, A., Marques-Silva, J.: Partial MUS enumeration. In: AAAI (2013)
2013
Earlier work this paper cites.
Alkassar, E., Böhme, S., Mehlhorn, K., Rizkallah, C.: A framework for the verification of certifying computations. J. Autom. Reasoning 52
2014
Earlier work this paper cites.
Fan, X., Toni, F.: On computing explanations in abstract argumentation. In: ECAI. pp. 1005–1006 (2014)
2014
Earlier work this paper cites.
Grégoire, É., Lagniez, J., Mazure, B.: An experimentally efficient method for (MSS, CoMSS) partitioning. In: AAAI. pp. 2666–2673 (2014)
2014
Earlier work this paper cites.
Metodi, A., Stern, R., Kalech, M., Codish, M.: A novel SAT-based approach to model based diagnosis. J. Artif. Intell. Res. 51
2014
Earlier work this paper cites.
Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning - From Theory to Algorithms. Cambridge University Press (2014), https://bit.ly/3LBlznb
2014
Earlier work this paper cites.
Simonyan, K., Vedaldi, A., Zisserman, A.: Deep inside convolutional networks: Visualising image classification models and saliency maps. In: ICLR (2014)
2014
Earlier work this paper cites.
Vardi, M.Y.: Boolean satisfiability: theory and engineering. Commun. ACM 57
2014
Earlier work this paper cites.
Voronkov, A.: AVATAR: the architecture for first-order theorem provers. In: CAV. pp. 696–710 (2014)
2014
Earlier work this paper cites.
Bacchus, F., Katsirelos, G.: Using minimal correction sets to more efficiently compute minimal unsatisfiable sets. In: CAV. pp. 70–86 (2015)
2015
Earlier work this paper cites.
Bach, S., Binder, A., Montavon, G., Klauschen, F., Müller, K.R., Samek, W.: On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation. PloS one 10
2015
Earlier work this paper cites.
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015), https://doi.org/10.1007/978-3-319-21275-3
2015
Earlier work this paper cites.
Ignatiev, A., Previti, A., Liffiton, M.H., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: CP. pp. 173–182 (2015)
2015
Earlier work this paper cites.
Janota, M., Marques-Silva, J.: Solving QBF by clause selection. In: IJCAI. pp. 325–331 (2015)
2015
Cited alongside, same era.
LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. nature 521
2015
Cited alongside, same era.
Marques-Silva, J., Janota, M., Ignatiev, A., Morgado, A.: Efficient model based diagnosis with maximum satisfiability. In: IJCAI. pp. 1966–1972 (2015)
2015
Cited alongside, same era.
Mencía, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: IJCAI. pp. 1973–1979 (2015)
2015
Cited alongside, same era.
Previti, A., Ignatiev, A., Morgado, A., Marques-Silva, J.: Prime compilation of non-clausal formulae. In: IJCAI. pp. 1980–1988 (2015)
2015
Cited alongside, same era.
Shi, W., Shih, A., Darwiche, A., Choi, A.: On tractable representations of binary neural networks. In: KR. pp. 882–892 (2020)
2020
Later among the works it cites.
Sivaraman, A., Farnadi, G., Millstein, T.D., den Broeck, G.V.: Counterexample-guided learning of monotonic neural networks. In: NeurIPS (2020)
2020
Later among the works it cites.
Sixt, L., Granz, M., Landgraf, T.: When explanations lie: Why many modified BP attributions fail. In: ICML. pp. 9046–9057 (2020)
2020
Later among the works it cites.
Slack, D., Hilgard, S., Jia, E., Singh, S., Lakkaraju, H.: Fooling LIME and SHAP: adversarial attacks on post hoc explanation methods. In: AIES. pp. 180–186 (2020)
2020
Later among the works it cites.
The Verge: UK ditches exam results generated by biased algorithm after student protests. https://bit.ly/3kevIsB (2020)
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…
2015
Cited alongside, same era.
Wang, F., Rudin, C.: Falling rule lists. In: AISTATS (2015)
2015
Cited alongside, same era.
Bacchus, F., Katsirelos, G.: Finding a collection of MUSes incrementally. In: CPAIOR. pp. 35–44 (2016)
2016
Cited alongside, same era.
Fard, M.M., Canini, K.R., Cotter, A., Pfeifer, J., Gupta, M.R.: Fast and flexible monotonic functions with ensembles of lattices. In: NeurIPS. pp. 2919–2927 (2016)
2016
Cited alongside, same era.
Goodfellow, I.J., Bengio, Y., Courville, A.C.: Deep Learning. Adaptive computation and machine learning, MIT Press (2016), http://www.deeplearningbook.org/
2016
Cited alongside, same era.
Hubara, I., Courbariaux, M., Soudry, D., El-Yaniv, R., Bengio, Y.: Binarized neural networks. In: NeurIPS. pp. 4107–4115 (2016)
2016
Cited alongside, same era.
Ignatiev, A., Morgado, A., Marques-Silva, J.: Propositional abduction with implicit hitting sets. pp. 1327–1335 (2016)
2016
Cited alongside, same era.
Tjoa, E., Guan, C.: A survey on explainable artificial intelligence (XAI): toward medical XAI. IEEE Trans. Neural Networks Learn. Syst. 32
2020
Later among the works it cites.
Venkatasubramanian, S., Alfano, M.: The philosophical basis of algorithmic recourse. In: FAT. pp. 284–293 (2020)
2020
Later among the works it cites.
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming. Constraints An Int. J. 25
2020
Later among the works it cites.
Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming (extended abstract). In: IJCAI. pp. 4765–4769 (2020)
2020
Later among the works it cites.
Yu, J., Ignatiev, A., Stuckey, P.J., Bodic, P.L.: Computing optimal decision sets with SAT. In: CP. pp. 952–970 (2020)
2020
Later among the works it cites.
2021
Later among the works it cites.
Amgoud, L.: Non-monotonic explanation functions. In: ECSQARU. pp. 19–31 (2021)
2021
Later among the works it cites.
Arenas, M., Baez, D., Barceló, P., Pérez, J., Subercaseaux, B.: Foundations of symbolic languages for model interpretability. In: NeurIPS. pp. 11690–11701 (2021)
2021
Later among the works it cites.
Arenas, M., Barceló, P., Bertossi, L.E., Monet, M.: The tractability of SHAP-score-based explanations for classification over deterministic and decomposable boolean circuits. In: AAAI. pp. 6670–6678 (2021)
2021
Later among the works it cites.
Asher, N., Paul, S., Russell, C.: Fair and adequate explanations. In: CD-MAKE. pp. 79–97 (2021)
2021
Later among the works it cites.
Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., Marquis, P.: On the computational intelligibility of boolean classifiers. In: KR. pp. 74–86 (2021)
2021
Later among the works it cites.
Australian Gov.: Australia’s AU action plan. tiny.cc/hy8juz (2021), accessed: 2021-12-01
2021
Later among the works it cites.
Australian Gov.: Australia’s artificial intelligence ethics framework. tiny.cc/ey8juz (2021), accessed: 2021-12-01
2021
Later among the works it cites.
Bengio, Y., LeCun, Y., Hinton, G.E.: Deep learning for AI. Commun. ACM 64
2021
Later among the works it cites.
Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2021)
2021
Later among the works it cites.
Blanc, G., Lange, J., Tan, L.: Provably efficient, succinct, and precise explanations. In: NeurIPS (2021)
2021
Later among the works it cites.
Bogaerts, B., Gamba, E., Guns, T.: A framework for step-wise explaining how to solve constraint satisfaction problems. Artif. Intell. 300
2021
Later among the works it cites.
Boumazouza, R., Alili, F.C., Mazure, B., Tabia, K.: ASTERYX: A model-agnostic sat-based approach for symbolic and score-based explanations. In: CIKM. pp. 120–129 (2021)
2021
Later among the works it cites.
den Broeck, G.V., Lykov, A., Schleich, M., Suciu, D.: On the tractability of SHAP explanations. In: AAAI. pp. 6505–6513 (2021)
2021
Later among the works it cites.
Chen, C., Lin, K., Rudin, C., Shaposhnik, Y., Wang, S., Wang, T.: A holistic approach to interpretability in financial lending: Models, visualizations, and summary-explanations. Decis. Support Syst. 152
2021
Later among the works it cites.
CNN: Tesla is under investigation because its cars keep hitting emergency vehicles. https://cnn.it/3z6NXGF (August 2021)
2021
Later among the works it cites.
Cooper, M.C., Marques-Silva, J.: On the tractability of explaining decisions of classifiers. In: Michel, L.D. (ed.) CP. pp. 21:1–21:18 (2021)
2021
Later among the works it cites.
DARPA: DARPA explainable Artificial Intelligence (XAI) program. https://www.darpa.mil/program/explainable-artificial-intelligence (2016), accessed: 2021-12-01
2021
Later among the works it cites.
Darwiche, A., Marquis, P.: On quantifying literals in boolean logic and its applications to explainable AI. J. Artif. Intell. Res. (2021)
2021
Later among the works it cites.
Demirovic, E., Stuckey, P.J.: Optimal decision trees for nonlinear metrics. In: AAAI. pp. 3733–3741 (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
EU: General Data Protection Regulation. https://eur-lex.europa.eu/eli/reg/2016/679/oj (2016), accessed: 2021-12-01
2021
Later among the works it cites.
EU: Artificial Intelligence Act. tiny.cc/wy8juz (2021), accessed: 2021-12-01
2021
Later among the works it cites.
EU: Coordinated plan on artificial intelligence – 2021 review. https://bit.ly/3hJG2HF (2021), accessed: 2021-12-01
2021
Later among the works it cites.
Gamba, E., Bogaerts, B., Guns, T.: Efficiently explaining CSPs with unsatisfiable subset optimization. In: IJCAI. pp. 1381–1388 (2021)
2021
Later among the works it cites.
Ghassemi, M., Oakden-Rayner, L., Beam, A.L.: The false hope of current approaches to explainable artificial intelligence in health care. The Lancet Digital Health 3
2021
Later among the works it cites.
Gocht, S., Nordström, J.: Certifying parity reasoning efficiently using pseudo-boolean proofs. In: AAAI. pp. 3768–3777 (2021)
2021
Later among the works it cites.
Gupta, S.D., Genc, B., O’Sullivan, B.: Explanation in constraint satisfaction: A survey. In: ICJAI. pp. 4400–4407 (2021)
2021
Later among the works it cites.
HLEG AI: Ethics guidelines for trustworthy AI. https://digital-strategy.ec.europa.eu/en/library/ethics-guidelines-trustworthy-ai (2019), accessed: 2021-12-01
2021
Later among the works it cites.
HLEG AI: Assessment list for trustworthy artificial intelligence (ALTAI) for self-assessment. https://bit.ly/3jAeHds (2020), accessed: 2021-12-01
2021
Later among the works it cites.
2021
Later among the works it cites.
Huang, X., Izza, Y., Ignatiev, A., Marques-Silva, J.: On efficiently explaining graph-based classifiers. In: KR. pp. 356–367 (2021)
2021
Later among the works it cites.
Ignatiev, A., Lam, E., Stuckey, P.J., Marques-Silva, J.: A scalable two stage approach to computing optimal decision sets. In: AAAI. pp. 3806–3814 (2021)
2021
Later among the works it cites.
Ignatiev, A., Marques-Silva, J.: SAT-based rigorous explanations for decision lists. In: SAT. pp. 251–269 (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
Izza, Y., Marques-Silva, J.: On explaining random forests with SAT. In: IJCAI. pp. 2584–2591 (2021)
2021
Later among the works it cites.
Karimi, A., Schölkopf, B., Valera, I.: Algorithmic recourse: from counterfactual explanations to interventions. In: FAccT. pp. 353–362 (2021)
2021
Later among the works it cites.
Krarup, B., Krivic, S., Magazzeni, D., Long, D., Cashmore, M., Smith, D.E.: Contrastive explanations of plans through model restrictions. J. Artif. Intell. Res. 72
2021
Later among the works it cites.
Liu, C., Arnon, T., Lazarus, C., Strong, C.A., Barrett, C.W., Kochenderfer, M.J.: Algorithms for verifying deep neural networks. Found. Trends Optim. 4
2021
Later among the works it cites.
Liu, X., Lorini, E.: A logic for binary classifiers and their explanation. In: CLAR (2021)
2021
Later among the works it cites.
Malfa, E.L., Michelmore, R., Zbrzezny, A.M., Paoletti, N., Kwiatkowska, M.: On guaranteed optimal robust explanations for NLP models. In: IJCAI. pp. 2658–2665 (2021)
2021
Later among the works it cites.
Marques-Silva, J., Gerspacher, T., Cooper, M.C., Ignatiev, A., Narodytska, N.: Explanations for monotonic classifiers. In: ICML. pp. 7469–7479 (2021)
2021
Later among the works it cites.
McGregor, S.: Preventing repeated real world AI failures by cataloging incidents: The AI incident database. In: AAAI. pp. 15458–15463 (2021)
2021
Later among the works it cites.
Newman, J.: Explainability won’t save AI
2021
Later among the works it cites.
OECD: Recommendation of the council on artificial intelligence. https://legalinstruments.oecd.org/en/instruments/OECD-LEGAL-0449 (2021), accessed: 2021-12-01
2021
Later among the works it cites.
Ordyniak, S., Szeider, S.: Parameterized complexity of small decision tree learning. In: AAAI. pp. 6454–6462 (2021)
2021
Later among the works it cites.
Rago, A., Cocarascu, O., Bechlivanidis, C., Lagnado, D.A., Toni, F.: Argumentative explanations for interactive recommendations. Artif. Intell. 296
2021
Later among the works it cites.
Samek, W., Montavon, G., Lapuschkin, S., Anders, C.J., Müller, K.: Explaining deep neural networks and beyond: A review of methods and applications. Proc. IEEE 109
2021
Later among the works it cites.
Schidler, A., Szeider, S.: SAT-based decision tree learning for large data sets. In: AAAI. pp. 3904–3912 (2021)
2021
Later among the works it cites.
Shati, P., Cohen, E., McIlraith, S.A.: SAT-based approach for learning optimal decision trees with non-binary features. In: CP. pp. 50:1–50:16 (2021)
2021
Later among the works it cites.
Sreedharan, S., Chakraborti, T., Kambhampati, S.: Foundations of explanations as model reconciliation. Artif. Intell. 301
2021
Later among the works it cites.
Sreedharan, S., Srivastava, S., Kambhampati, S.: Using state abstractions to compute personalized contrastive explanations for AI agent behavior. Artif. Intell. 301
2021
Later among the works it cites.
UNESCO: Draft recommendation on the ethics of artificial intelligence. https://unesdoc.unesco.org/ark:/48223/pf0000374266 (June 2021), accessed: 2021-12-01
2021
Later among the works it cites.
Vos, D., Verwer, S.: Efficient training of robust decision trees against adversarial examples. In: ICML. pp. 10586–10595 (2021)
2021
Later among the works it cites.
Wäldchen, S., MacDonald, J., Hauch, S., Kutyniok, G.: The computational complexity of understanding binary classifier decisions. J. Artif. Intell. Res. 70
2021
Later among the works it cites.
2021
Later among the works it cites.
Yu, J., Ignatiev, A., Stuckey, P.J., Bodic, P.L.: Learning optimal decision sets and lists with SAT. J. Artif. Intell. Res. 72
2021
Later among the works it cites.
Amgoud, L., Ben-Naim, J.: Axiomatic foundations of explainability. In: IJCAI. pp. 636–642 (2022)
2022
Closest in time.
Arenas, M., Barceló, P., Romero, M., Subercaseaux, B.: On computing probabilistic explanations for decision trees. In: NeurIPS (2022)
2022
Closest in time.
2022
Closest in time.
Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., Marquis, P.: On preferred abductive explanations for decision trees and random forests. In: IJCAI. pp. 643–650 (2022)
2022
Closest in time.
Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., Marquis, P.: On the explanatory power of boolean decision trees. Data Knowl. Eng. 142
2022
Closest in time.
Audemard, G., Bellart, S., Bounia, L., Koriche, F., Lagniez, J., Marquis, P.: Trading complexity for sparsity in random forest explanations. In: AAAI. pp. 5461–5469 (2022)
2022
Closest in time.
Behrouz, A., Lécuyer, M., Rudin, C., Seltzer, M.I.: Fast optimization of weighted sparse decision trees for use in optimal treatment regimes and optimal policy design. In: CIKM Workshops (2022)
2022
Closest in time.
Blanc, G., Koch, C., Lange, J., Tan, L.: The query complexity of certification. In: STOC. pp. 623–636 (2022)
2022
Closest in time.
Blanc, G., Koch, C., Lange, J., Tan, L.: A query-optimal algorithm for finding counterfactuals. In: ICML. pp. 2075–2090 (2022)
2022
Closest in time.
Darwiche, A., Hirth, A.: On the (complete) reasons behind decisions. Journal of Logic, Language and Information pp. 1–26 (2022), in press
2022
Closest in time.
Darwiche, A., Ji, C.: On the computation of necessary and sufficient explanations. In: AAAI. pp. 5582–5591 (2022)
2022
Closest in time.
Demirovic, E., Lukina, A., Hebrard, E., Chan, J., Bailey, J., Leckie, C., Ramamohanarao, K., Stuckey, P.J.: Murtree: Optimal decision trees via dynamic programming and search. J. Mach. Learn. Res. 23
2022
Closest in time.
Eifler, R., Frank, J., Hoffmann, J.: Explaining soft-goal conflicts through constraint relaxations. In: IJCAI. pp. 4621–4627 (2022), https://doi.org/10.24963/ijcai.2022/641
2022
Closest in time.
Ferreira, J., de Sousa Ribeiro, M., Gonçalves, R., Leite, J.: Looking inside the black-box: Logic-based explanations for neural networks. In: KR. p. 432–442 (2022)
2022
Closest in time.
Ghosh, B., Malioutov, D., Meel, K.S.: Efficient learning of interpretable classification rules. J. Artif. Intell. Res. 74
2022
Closest in time.
Gorji, N., Rubin, S.: Sufficient reasons for classifier decisions in the presence of domain constraints. In: AAAI (February 2022)
2022
Closest in time.
Holzinger, A., Goebel, R., Fong, R., Moon, T., Müller, K., Samek, W. (eds.): xxAI - Beyond Explainable AI - International Workshop, Held in Conjunction with ICML 2020, July 18, 2020, Vienna, Austria, Revised and Extended Papers, Lecture Notes in Computer Science, vol. 13200. Springer (2022), https://doi.org/10.1007/978-3-031-04083-2
2022
Closest in time.
Huang, X., Izza, Y., Ignatiev, A., Cooper, M.C., Asher, N., Marques-Silva, J.: Tractable explanations for d-DNNF classifiers. In: AAAI. pp. 5719–5728 (2022)
2022
Closest in time.
2022
Closest in time.
Ignatiev, A., Izza, Y., Stuckey, P.J., Marques-Silva, J.: Using MaxSAT for efficient explanations of tree ensembles. In: AAAI. pp. 3776–3785 (2022)
2022
Closest in time.
2022
Closest in time.
Izza, Y., Ignatiev, A., Marques-Silva, J.: On tackling explanation redundancy in decision trees. J. Artif. Intell. Res. 75
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Izza, Y., Marques-Silva, J.: On computing relevant features for explaining NBCs. CoRR abs/2207.04748
2022
Closest in time.
Kim, T.W., Routledge, B.R.: Why a right to an explanation of algorithmic decision-making should exist: A trust-based approach. Business Ethics Quarterly 32
2022
Closest in time.
Koch, T., Berthold, T., Pedersen, J., Vanaret, C.: Progress in mathematical programming solvers from 2001 to 2020. EURO Journal on Computational Optimization p. 100031 (2022)
2022
Closest in time.
2022
Closest in time.
Labreuche, C.: Explanation of pseudo-boolean functions using cooperative game theory and prime implicants. In: SUM. pp. 295–308 (2022)
2022
Closest in time.
Liu, J., Zhong, C., Li, B., Seltzer, M., Rudin, C.: Fasterrisk: Fast and accurate interpretable risk scores. In: NeurIPS (2022)
2022
Closest in time.
Liu, X., Lorini, E.: A logic of "black box" classifier systems. In: WoLLIC. pp. 158–174 (2022)
2022
Closest in time.
Marques-Silva, J., Ignatiev, A.: Delivering trustworthy AI through formal XAI. In: AAAI. pp. 12342–12350 (2022)
2022
Closest in time.
2022
Closest in time.
McTavish, H., Zhong, C., Achermann, R., Karimalis, I., Chen, J., Rudin, C., Seltzer, M.: How smart guessing strategies can yield massive scalability improvements for sparse decision tree optimization. In: AAAI (February 2022)
2022
Closest in time.
2022
Closest in time.
Ras, G., Xie, N., van Gerven, M., Doran, D.: Explainable deep learning: A field guide for the uninitiated. J. Artif. Intell. Res. 73
2022
Closest in time.
Rudin, C., Chen, C., Chen, Z., Huang, H., Semenova, L., Zhong, C.: Interpretable machine learning: Fundamental principles and 10 grand challenges. Statistics Surveys 16
2022
Closest in time.
Semenova, L., Rudin, C., Parr, R.: On the existence of simpler machine learning models. In: FAccT. pp. 1827–1858 (2022)
2022
Closest in time.
Seshia, S.A., Sadigh, D., Sastry, S.S.: Toward verified artificial intelligence. Commun. ACM 65
2022
Closest in time.
Sreedharan, S., Soni, U., Verma, M., Srivastava, S., Kambhampati, S.: Bridging the gap: Providing post-hoc symbolic explanations for sequential decision-making problems with inscrutable representations. In: ICLR (2022)
2022
Closest in time.
Vasileiou, S.L., Yeoh, W., Son, T.C., Kumar, A., Cashmore, M., Magazzeni, D.: A logic-based explanation generation framework for classical and hybrid planning problems. J. Artif. Intell. Res. 73
2022
Closest in time.
Vos, D., Verwer, S.: Robust optimal classification trees against adversarial examples. In: AAAI. pp. 8520–8528 (2022)
2022
Closest in time.
Wäldchen, S.: Towards Explainable Artificial Intelligence – Interpreting Neural Network Classifiers with Probabilistic Prime Implicants. Ph.D. thesis, Technischen Universität Berlin (3 2022)
2022
Closest in time.
Wang, H., Shakerin, F., Gupta, G.: FOLD-RM: A scalable, efficient, and explainable inductive learning algorithm for multi-category classification of mixed data. Theory Pract. Log. Program. 22
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
AI Incident Database: https://incidentdatabase.ai/ (2023)
2023
Closest in time.
Amgoud, L.: Int. J. Approx. Reason. (2023), in Press
2023
Closest in time.
Bassan, S., Katz, G.: Towards formal approximated minimal explanations of neural networks. In: TACAS (2023)
2023
Closest in time.
Bianchi, F., Curry, A.C., Hovy, D.: Viewpoint: Artificial intelligence accidents waiting to happen? J. Artif. Intell. Res. 76
2023
Closest in time.
Béjar, R., Morgado, A., Planes, J., Marques-Silva, J.: Logic-based explainability with missing data (2023), working paper
2023
Closest in time.
Cooper, M.C., Marques-Silva, J.: Tractability of explaining classifier decisions. Artif. Intell. (2023), https://www.sciencedirect.com/science/article/pii/S0004370222001813
2023
Closest in time.
Huang, X., Cooper, M.C., Morgado, A., Planes, J., Marques-Silva, J.: Feature necessity & relevancy in ML classifier explanations. In: TACAS (2023)
2023
Closest in time.
Huang, X., Izza, Y., Marques-Silva, J.: Solving explainability queries with quantification: The case of feature membership. In: AAAI (2023)
2023
Closest in time.