21 citations · 46 across the 5 of their papers we have counts for
4 papers · 1 filter
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…