{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T09:02:08Z","timestamp":1724922128908},"reference-count":108,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ijar.2023.108939","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T21:17:58Z","timestamp":1684185478000},"page":"108939","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On computing probabilistic abductive explanations"],"prefix":"10.1016","volume":"159","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7774-1945","authenticated-orcid":false,"given":"Yacine","family":"Izza","sequence":"first","affiliation":[]},{"given":"Xuanxiang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Ignatiev","sequence":"additional","affiliation":[]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2023.108939_br0010","author":"EU"},{"key":"10.1016\/j.ijar.2023.108939_br0020","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","article-title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","volume":"1","author":"Rudin","year":"2019","journal-title":"Nat. Mach. Intell."},{"key":"10.1016\/j.ijar.2023.108939_br0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dsp.2017.10.011","article-title":"Methods for interpreting and understanding deep neural networks","volume":"73","author":"Montavon","year":"2018","journal-title":"Digit. Signal Process."},{"key":"10.1016\/j.ijar.2023.108939_br0040","doi-asserted-by":"crossref","first-page":"93:1","DOI":"10.1145\/3236009","article-title":"A survey of methods for explaining black box models","volume":"51","author":"Guidotti","year":"2019","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.ijar.2023.108939_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2018.07.007","article-title":"Explanation in artificial intelligence: insights from the social sciences","volume":"267","author":"Miller","year":"2019","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.108939_br0060","series-title":"Explainable AI: Interpreting, Explaining and Visualizing Deep Learning","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0070","doi-asserted-by":"crossref","unstructured":"W. Samek, K. M\u00fcller, Towards explainable artificial intelligence, in: [6], 2019, pp. 5\u201322 https:\/\/doi.org\/10.1007\/978-3-030-28954-6_1.","DOI":"10.1007\/978-3-030-28954-6_1"},{"key":"10.1016\/j.ijar.2023.108939_br0080","series-title":"Interpretable Machine Learning","author":"Molnar","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0090","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/JPROC.2021.3060483","article-title":"Explaining deep neural networks and beyond: a review of methods and applications","volume":"109","author":"Samek","year":"2021","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.ijar.2023.108939_br0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(02)00258-8","article-title":"Explanations, belief revision and defeasible reasoning","volume":"141","author":"Falappa","year":"2002","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.108939_br0110","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","article-title":"Consistency restoration and explanations in dynamic csps application to configuration","volume":"135","author":"Amilhastre","year":"2002","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.108939_br0120","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10458-007-9025-6","article-title":"Agents that argue and explain classifications","volume":"16","author":"Amgoud","year":"2008","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.ijar.2023.108939_br0130","series-title":"AAAI","article-title":"Delivering trustworthy AI through formal XAI","author":"Marques-Silva","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0140","series-title":"KDD","first-page":"1135","article-title":"\u201cWhy should I trust you?\u201d: explaining the predictions of any classifier","author":"Ribeiro","year":"2016"},{"key":"10.1016\/j.ijar.2023.108939_br0150","series-title":"NeurIPS","first-page":"4765","article-title":"A unified approach to interpreting model predictions","author":"Lundberg","year":"2017"},{"key":"10.1016\/j.ijar.2023.108939_br0160","series-title":"AAAI","first-page":"1527","article-title":"High-precision model-agnostic explanations","author":"Ribeiro","year":"2018"},{"key":"10.1016\/j.ijar.2023.108939_br0170","series-title":"ICLR","article-title":"Deep inside convolutional networks: visualising image classification models and saliency maps","author":"Simonyan","year":"2014"},{"key":"10.1016\/j.ijar.2023.108939_br0180","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0130140","article-title":"On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation","volume":"10","author":"Bach","year":"2015","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ijar.2023.108939_br0190","series-title":"NeurIPS","first-page":"9525","article-title":"Sanity checks for saliency maps","author":"Adebayo","year":"2018"},{"key":"10.1016\/j.ijar.2023.108939_br0200","series-title":"Explainable AI: Interpreting, Explaining and Visualizing Deep Learning","first-page":"267","article-title":"The (un)reliability of saliency methods","volume":"vol. 11700","author":"Kindermans","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0210","author":"Viering"},{"key":"10.1016\/j.ijar.2023.108939_br0220","series-title":"ICML","first-page":"9046","article-title":"When explanations Lie: why many modified BP attributions fail","author":"Sixt","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0230","author":"Izza"},{"key":"10.1016\/j.ijar.2023.108939_br0240","series-title":"SAT","first-page":"251","article-title":"SAT-based rigorous explanations for decision lists","author":"Ignatiev","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0250","series-title":"KR","first-page":"356","article-title":"On efficiently explaining graph-based classifiers","author":"Huang","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0260","author":"Izza"},{"key":"10.1016\/j.ijar.2023.108939_br0270","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1613\/jair.1.13575","article-title":"On tackling explanation redundancy in decision trees","volume":"75","author":"Izza","year":"2022","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2023.108939_br0280","series-title":"IJCAI","first-page":"5154","article-title":"Towards trustable explainable AI","author":"Ignatiev","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0290","author":"Camburu"},{"key":"10.1016\/j.ijar.2023.108939_br0300","series-title":"AIES","first-page":"180","article-title":"Fooling LIME and SHAP: adversarial attacks on post hoc explanation methods","author":"Slack","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0310","series-title":"AIES","first-page":"79","article-title":"\u201cHow do I fool you?\u201d: manipulating user trust via misleading black box explanations","author":"Lakkaraju","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0320","series-title":"ECAI","first-page":"2473","article-title":"You shouldn't trust me: learning models which conceal unfairness from multiple explanation methods","author":"Dimanov","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0330","series-title":"IJCAI","first-page":"5103","article-title":"A symbolic approach to explaining bayesian network classifiers","author":"Shih","year":"2018"},{"key":"10.1016\/j.ijar.2023.108939_br0340","series-title":"AAAI","first-page":"1511","article-title":"Abduction-based explanations for machine learning models","author":"Ignatiev","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0350","series-title":"ECAI","first-page":"712","article-title":"On the reasons behind decisions","author":"Darwiche","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0360","series-title":"KR","first-page":"838","article-title":"On tractable XAI queries based on compiled representations","author":"Audemard","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0370","series-title":"IJCAI","first-page":"2658","article-title":"On guaranteed optimal robust explanations for NLP models","author":"Malfa","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0380","series-title":"CIKM","first-page":"120","article-title":"ASTERYX: a model-agnostic sat-based approach for symbolic and score-based explanations","author":"Boumazouza","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0390","series-title":"AAAI","article-title":"Sufficient reasons for classifier decisions in the presence of domain constraints","author":"Gorji","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0400","author":"Yu"},{"key":"10.1016\/j.ijar.2023.108939_br0410","series-title":"IJCAI","first-page":"3082","article-title":"Probabilistic sufficient explanations","author":"Wang","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0420","first-page":"351","article-title":"The computational complexity of understanding binary classifier decisions","volume":"70","author":"W\u00e4ldchen","year":"2021","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2023.108939_br0430","series-title":"Towards Explainable Artificial Intelligence \u2013 Interpreting Neural Network Classifiers with Probabilistic Prime Implicants","author":"W\u00e4ldchen","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0440","author":"Izza"},{"key":"10.1016\/j.ijar.2023.108939_br0450","author":"Izza"},{"key":"10.1016\/j.ijar.2023.108939_br0460","series-title":"Computational Complexity - a Modern Approach","author":"Arora","year":"2009"},{"key":"10.1016\/j.ijar.2023.108939_br0470","series-title":"Handbook of Satisfiability","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0480","series-title":"STOC","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/j.ijar.2023.108939_br0490","series-title":"Handbook of Satisfiability","first-page":"825","article-title":"Satisfiability modulo theories","volume":"vol. 185","author":"Barrett","year":"2009"},{"key":"10.1016\/j.ijar.2023.108939_br0500","series-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"10.1016\/j.ijar.2023.108939_br0510","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2023.108939_br0520","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","article-title":"Bayesian network classifiers","volume":"29","author":"Friedman","year":"1997","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2023.108939_br0530","series-title":"Decision Graphs \u2013 an Extension of Decision Trees","author":"Oliver","year":"1992"},{"key":"10.1016\/j.ijar.2023.108939_br0540","series-title":"AAI","article-title":"Inferring decision graphs using the minimum message length principle","author":"Oliver","year":"1992"},{"key":"10.1016\/j.ijar.2023.108939_br0550","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","article-title":"A knowledge compilation map","volume":"17","author":"Darwiche","year":"2002","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2023.108939_br0560","series-title":"IJCAI","first-page":"819","article-title":"SDD: a new canonical representation of propositional knowledge bases","author":"Darwiche","year":"2011"},{"key":"10.1016\/j.ijar.2023.108939_br0570","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1007413323501","article-title":"Decision tree induction based on efficient tree restructuring","volume":"29","author":"Utgoff","year":"1997","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2023.108939_br0580","series-title":"Pattern Classification","author":"Duda","year":"1973"},{"key":"10.1016\/j.ijar.2023.108939_br0590","series-title":"NeurIPS","article-title":"Explaining naive Bayes and other linear classifiers with polynomial time and delay","author":"Marques-Silva","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0600","series-title":"Multi-Valued Decision Diagrams","author":"Kam","year":"1990"},{"key":"10.1016\/j.ijar.2023.108939_br0610","series-title":"1990 IEEE International Conference on Computer-Aided Design","first-page":"92","article-title":"Algorithms for discrete function manipulation","author":"Srinivasan","year":"1990"},{"key":"10.1016\/j.ijar.2023.108939_br0620","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ijar.2023.108939_br0630","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/502090.502091","article-title":"Decomposable negation normal form","volume":"48","author":"Darwiche","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/j.ijar.2023.108939_br0640","series-title":"CAI","first-page":"356","article-title":"Dsharp: fast d-DNNF compilation with sharpSAT","author":"Muise","year":"2012"},{"key":"10.1016\/j.ijar.2023.108939_br0650","doi-asserted-by":"crossref","first-page":"11","DOI":"10.3166\/jancl.11.11-34","article-title":"On the tractable counting of theory models and its application to truth maintenance and belief revision","volume":"11","author":"Darwiche","year":"2001","journal-title":"J. Appl. Non-Class. Log."},{"key":"10.1016\/j.ijar.2023.108939_br0660","series-title":"AAAI","first-page":"1641","article-title":"On the role of canonicity in knowledge compilation","author":"Van den Broeck","year":"2015"},{"key":"10.1016\/j.ijar.2023.108939_br0670","series-title":"Graph Structures for Knowledge Representation and Reasoning","first-page":"137","article-title":"Representing csps with set-labeled diagrams: a compilation map","author":"Niveau","year":"2012"},{"key":"10.1016\/j.ijar.2023.108939_br0680","series-title":"Bayesian Reasoning and Machine Learning","author":"Barber","year":"2012"},{"key":"10.1016\/j.ijar.2023.108939_br0690","series-title":"IJCAI","first-page":"2584","article-title":"On explaining random forests with SAT","author":"Izza","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0700","series-title":"ICML","first-page":"7469","article-title":"Explanations for monotonic classifiers","author":"Marques-Silva","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0710","series-title":"CP","first-page":"21:1","article-title":"On the tractability of explaining decisions of classifiers","author":"Cooper","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0720","series-title":"AAAI","article-title":"Tractable explanations for d-DNNF classifiers","author":"Huang","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0730","series-title":"AAAI","article-title":"Using MaxSAT for efficient explanations of tree ensembles","author":"Ignatiev","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0740","series-title":"AIxIA","first-page":"335","article-title":"From contrastive to abductive explanations and back again","author":"Ignatiev","year":"2020"},{"key":"10.1016\/j.ijar.2023.108939_br0750","series-title":"AAAI","first-page":"7966","article-title":"Compiling bayesian network classifiers into decision graphs","author":"Shih","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0760","author":"Huang"},{"key":"10.1016\/j.ijar.2023.108939_br0770","series-title":"KR","first-page":"74","article-title":"On the computational intelligibility of boolean classifiers","author":"Audemard","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0780","author":"Huang"},{"key":"10.1016\/j.ijar.2023.108939_br0790","series-title":"NeurIPS","first-page":"15857","article-title":"On relating explanations and adversarial examples","author":"Ignatiev","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0800","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1037\/h0043158","article-title":"The magical number seven, plus or minus two: some limits on our capacity for processing information","volume":"63","author":"Miller","year":"1956","journal-title":"Psychol. Rev."},{"key":"10.1016\/j.ijar.2023.108939_br0810","series-title":"AIES","first-page":"255","article-title":"A formal approach to explainability","author":"Wolf","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0820","series-title":"ECSQARU","first-page":"19","article-title":"Non-monotonic explanation functions","author":"Amgoud","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0830","series-title":"CLAR","first-page":"302","article-title":"A logic for binary classifiers and their explanation","author":"Liu","year":"2021"},{"key":"10.1016\/j.ijar.2023.108939_br0840","series-title":"SAT","first-page":"267","article-title":"Assessing heuristic machine learning explanations with model counting","author":"Narodytska","year":"2019"},{"key":"10.1016\/j.ijar.2023.108939_br0850","author":"Izza"},{"key":"10.1016\/j.ijar.2023.108939_br0860","author":"Arenas"},{"key":"10.1016\/j.ijar.2023.108939_br0870","series-title":"NeurIPS","article-title":"On computing probabilistic explanations for decision trees","author":"Arenas","year":"2022"},{"key":"10.1016\/j.ijar.2023.108939_br0880","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.artint.2017.07.005","article-title":"Minimal sets on propositional formulae. problems and reductions","volume":"252","author":"Marques-Silva","year":"2017","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.108939_br0890","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ijar.2023.108939_br0900","series-title":"AAAI","first-page":"999","article-title":"Learning abductive reasoning using random examples","author":"Juba","year":"2016"},{"key":"10.1016\/j.ijar.2023.108939_br0910","series-title":"A System of Logic, Ratiocinative and Inductive, vol. 1","author":"Mill","year":"1843"},{"key":"10.1016\/j.ijar.2023.108939_br0920","series-title":"AAAI","first-page":"167","article-title":"QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems","author":"Junker","year":"2004"},{"key":"10.1016\/j.ijar.2023.108939_br0930","series-title":"CAV","first-page":"592","article-title":"Minimal sets over monotone predicates in boolean formulae","author":"Marques-Silva","year":"2013"},{"key":"10.1016\/j.ijar.2023.108939_br0940","series-title":"SAT","first-page":"58","article-title":"On computing preferred MUSes and MCSes","author":"Marques-Silva","year":"2014"},{"key":"10.1016\/j.ijar.2023.108939_br0950","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","article-title":"Fast, flexible MUS enumeration","volume":"21","author":"Liffiton","year":"2016","journal-title":"Constraints"},{"key":"10.1016\/j.ijar.2023.108939_br0960","series-title":"Knapsack Problems","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.ijar.2023.108939_br0970","series-title":"STOC","first-page":"693","article-title":"Approximate counting by dynamic programming","author":"Dyer","year":"2003"},{"key":"10.1016\/j.ijar.2023.108939_br0980","series-title":"FOCS","first-page":"817","article-title":"An FPTAS for #knapsack and related counting problems","author":"Gopalan","year":"2011"},{"key":"10.1016\/j.ijar.2023.108939_br0990","series-title":"ICALP","first-page":"64:1","article-title":"A faster FPTAS for #knapsack","author":"Gawrychowski","year":"2018"},{"key":"10.1016\/j.ijar.2023.108939_br1000","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.ic.2019.04.001","article-title":"Faster FPTASes for counting and random generation of knapsack solutions","volume":"267","author":"Rizzi","year":"2019","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ijar.2023.108939_br1010","series-title":"AAAI","first-page":"682","article-title":"Using weighted MAX-SAT engines to solve MPE","author":"Park","year":"2002"},{"key":"10.1016\/j.ijar.2023.108939_br1020","series-title":"IJCAI","first-page":"947","article-title":"Knowledge compilation for model counting: affine decision trees","author":"Koriche","year":"2013"},{"key":"10.1016\/j.ijar.2023.108939_br1030","series-title":"TACAS","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de Moura","year":"2008"},{"key":"10.1016\/j.ijar.2023.108939_br1040","author":"Dua"},{"key":"10.1016\/j.ijar.2023.108939_br1050","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","article-title":"Optimal classification trees","volume":"106","author":"Bertsimas","year":"2017","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2023.108939_br1060","author":"IAI"},{"key":"10.1016\/j.ijar.2023.108939_br1070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13040-017-0154-4","article-title":"Pmlb: a large benchmark suite for machine learning evaluation and comparison","volume":"10","author":"Olson","year":"2017","journal-title":"BioData Min."},{"key":"10.1016\/j.ijar.2023.108939_br1080","first-page":"2825","article-title":"Scikit-learn: machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X23000701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X23000701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T14:08:55Z","timestamp":1694009335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X23000701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":108,"alternative-id":["S0888613X23000701"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2023.108939","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On computing probabilistic abductive explanations","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2023.108939","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"108939"}}