research
∙
12/12/2022
On Computing Probabilistic Abductive Explanations
The most widely studied explainable AI (XAI) approaches are unsound. Thi...
share
research
∙
10/27/2022
Feature Necessity Relevancy in ML Classifier Explanations
Given a machine learning (ML) model and a prediction, explanations can b...
research
∙
05/19/2022
Provably Precise, Succinct and Efficient Explanations for Decision Trees
Decision trees (DTs) embody interpretable classifiers. DTs have been adv...
research
∙
07/04/2021
Efficient Explanations for Knowledge Compilation Languages
Knowledge compilation (KC) languages find a growing number of practical ...
research
∙
06/01/2021
Efficient Explanations With Relevant Sets
Recent work proposed δ-relevant inputs (or sets) as a probabilistic expl...
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
∙
07/13/2020
Strengthening neighbourhood substitution
Domain reduction is an essential tool for solving the constraint satisfa...
research
∙
11/19/2019
Steepest ascent can be exponential in bounded treewidth problems
We investigate the complexity of local search based on steepest ascent. ...
research
∙
05/10/2019
Variable elimination in binary CSPs
We investigate rules which allow variable elimination in binary CSP (con...
research
∙
04/20/2017
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns
Singleton arc consistency is an important type of local consistency whic...
research
∙
06/10/2016
Simple epistemic planning: generalised gossiping
The gossip problem, in which information (known as secrets) must be shar...
research
∙
02/12/2015
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP)...
research
∙
04/14/2014
On Backdoors To Tractable Constraint Languages
In the context of CSPs, a strong backdoor is a subset of variables such ...
research
∙
01/23/2014
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
The minimisation problem of a sum of unary and pairwise functions of dis...
research
∙
01/18/2012
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Although the CSP (constraint satisfaction problem) is NP-complete, even ...
research
∙
03/08/2011
