48 citations · 232 across the 19 of their papers we have counts for
9 papers · 1 filter
On Computing Probabilistic Abductive Explanations
Yacine Izza, Xuanxiang Huang, Alexey Ignatiev +3
The most widely studied explainable AI (XAI) approaches are unsound. This is the case with well-known model-agnostic explanation approaches, and it is also the case with approaches…
Provably Precise, Succinct and Efficient Explanations for Decision Trees
Yacine Izza, Alexey Ignatiev, Nina Narodytska +2
Decision trees (DTs) embody interpretable classifiers. DTs have been advocated for deployment in high-risk applications, but also for explaining other complex classifiers. Neverthe…
Efficient Explanations for Knowledge Compilation Languages
Xuanxiang Huang, Yacine Izza, Alexey Ignatiev +3
Knowledge compilation (KC) languages find a growing number of practical uses, including in Constraint Programming (CP) and in Machine Learning (ML). In most applications, one natur…
Strengthening neighbourhood substitution
Martin C. Cooper
Domain reduction is an essential tool for solving the constraint satisfaction problem (CSP). In the binary CSP, neighbourhood substitution consists in eliminating a value if there…
Simple epistemic planning: generalised gossiping
Martin C. Cooper, Andreas Herzig, Faustine Maffre +2
The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of c…
On Backdoors To Tractable Constraint Languages
Clement Carbonnel, Martin C. Cooper, Emmanuel Hebrard
In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the pr…
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Martin C. Cooper, Guillaume Escamocher
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of…
The tractability of CSP classes defined by forbidden patterns
David A. Cohen, Martin C. Cooper, Páidí Creed +1
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort…
Hybrid tractability of soft constraint problems
Martin C. Cooper, Stanislav Zivny
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems…