research
∙
05/03/2023
Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks
Minimal trap spaces (MTSs) capture subspaces in which the Boolean dynami...
share
research
∙
09/16/2022
Computing Abductive Explanations for Boosted Trees
Boosted trees is a dominant ML model, exhibiting high accuracy. However,...
research
∙
09/18/2021
Design and Results of ICCMA 2021
Since 2015, the International Competition on Computational Models of Arg...
research
∙
08/11/2021
Trading Complexity for Sparsity in Random Forest Explanations
Random forests have long been considered as powerful model ensembles in ...
research
∙
08/11/2021
On the Explanatory Power of Decision Trees
Decision trees have long been recognized as models of choice in sensitiv...
research
∙
04/13/2021
On the Computational Intelligibility of Boolean Classifiers
In this paper, we investigate the computational intelligibility of Boole...
research
∙
07/12/2013
Improving MUC extraction thanks to local search
ExtractingMUCs(MinimalUnsatisfiableCores)fromanunsatisfiable constraint ...
research
∙
10/07/2009
