research
∙
09/06/2023
A Refutation of Shapley Values for Explainability
Recent work demonstrated the existence of Boolean functions for which Sh...
share
research
∙
06/27/2023
On Logic-Based Explainability with Partially Specified Inputs
In the practical deployment of machine learning (ML) models, missing dat...
research
∙
06/27/2023
Delivering Inflated Explanations
In the quest for Explainable Artificial Intelligence (XAI) one of the qu...
research
∙
06/05/2023
From Robustness to Explainability and Back Again
In contrast with ad-hoc methods for eXplainable Artificial Intelligence ...
research
∙
02/16/2023
The Inadequacy of Shapley Values for Explainability
This paper develops a rigorous argument for why the use of Shapley value...
research
∙
12/12/2022
On Computing Probabilistic Abductive Explanations
The most widely studied explainable AI (XAI) approaches are unsound. Thi...
research
∙
10/27/2022
Feature Necessity Relevancy in ML Classifier Explanations
Given a machine learning (ML) model and a prediction, explanations can b...
research
∙
07/11/2022
On Computing Relevant Features for Explaining NBCs
Despite the progress observed with model-agnostic explainable AI (XAI), ...
research
∙
06/20/2022
Eliminating The Impossible, Whatever Remains Must Be True
The rise of AI methods to make predictions and decisions has led to a pr...
research
∙
05/20/2022
On Tackling Explanation Redundancy in Decision Trees
Decision trees (DTs) epitomize the ideal of interpretability of machine ...
research
∙
05/19/2022
Provably Precise, Succinct and Efficient Explanations for Decision Trees
Decision trees (DTs) embody interpretable classifiers. DTs have been adv...
research
∙
02/15/2022
On Deciding Feature Membership in Explanations of SDD Related Classifiers
When reasoning about explanations of Machine Learning (ML) classifiers, ...
research
∙
07/04/2021
Efficient Explanations for Knowledge Compilation Languages
Knowledge compilation (KC) languages find a growing number of practical ...
research
∙
06/02/2021
On Efficiently Explaining Graph-Based Classifiers
Recent work has shown that not only decision trees (DTs) may not be inte...
research
∙
06/01/2021
Efficient Explanations With Relevant Sets
Recent work proposed δ-relevant inputs (or sets) as a probabilistic expl...
research
∙
06/01/2021
Explanations for Monotonic Classifiers
In many classification tasks there is a requirement of monotonicity. Con...
research
∙
05/21/2021
On Explaining Random Forests with SAT
Random Forest (RFs) are among the most widely used Machine Learning (ML)...
research
∙
05/14/2021
SAT-Based Rigorous Explanations for Decision Lists
Decision lists (DLs) find a wide range of uses for classification proble...
research
∙
03/18/2021
MILP for the Multi-objective VM Reassignment Problem
Machine Reassignment is a challenging problem for constraint programming...
research
∙
02/03/2021
A Scalable Two Stage Approach to Computing Optimal Decision Sets
Machine learning (ML) is ubiquitous in modern life. Since it is being de...
research
∙
12/21/2020
On Relating 'Why?' and 'Why Not?' Explanations
Explanations of Machine Learning (ML) models often address a 'Why?' ques...
research
∙
10/21/2020
On Explaining Decision Trees
Decision trees (DTs) epitomize what have become to be known as interpret...
research
∙
08/13/2020
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay
Recent work proposed the computation of so-called PI-explanations of Nai...
research
∙
12/13/2019
From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group)
This paper proposes a tentative and original survey of meeting points be...
research
∙
07/04/2019
On Validating, Repairing and Refining Heuristic ML Explanations
Recent years have witnessed a fast-growing interest in computing explana...
research
∙
11/26/2018
Abduction-Based Explanations for Machine Learning Models
The growing range of applications of Machine Learning (ML) in a multitud...
research
∙
07/05/2012
Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality
Detection and elimination of redundant clauses from propositional formul...
research
∙
09/13/2011
On Validating Boolean Optimizers
Boolean optimization finds a wide range of application domains, that mot...
research
∙
11/09/2009
Industrial-Strength Formally Certified SAT Solving
Boolean Satisfiability (SAT) solvers are now routinely used in the verif...
research
∙
10/20/2009
How to Complete an Interactive Configuration Process?
When configuring customizable software, it is useful to provide interact...
research
∙
09/30/2009