389 citations · 1.4k across the 52 of their papers we have counts for
56 papers
Logic for Explainable AI
Adnan Darwiche
A central quest in explainable AI relates to understanding the decisions made by (learned) classifiers. There are three dimensions of this understanding that have been receiving si…
A New Class of Explanations for Classifiers with Non-Binary Features
Chunxi Ji, Adnan Darwiche
Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was mad…
An Algorithm and Complexity Results for Causal Unit Selection
Haiying Huang, Adnan Darwiche
The unit selection problem aims to identify objects, called units, that are most likely to exhibit a desired mode of behavior when subjected to stimuli (e.g., customers who are abo…
On the Complexity of Counterfactual Reasoning
Yunqiu Han, Yizuo Chen, Adnan Darwiche
We study the computational complexity of counterfactual reasoning in relation to the complexity of associational and interventional reasoning on structural causal models (SCMs). We…
On the Computation of Necessary and Sufficient Explanations
Adnan Darwiche, Chunxi Ji
The complete reason behind a decision is a Boolean formula that characterizes why the decision was made. This recently introduced notion has a number of applications, which include…
Tractable Boolean and Arithmetic Circuits
Adnan Darwiche
Tractable Boolean and arithmetic circuits have been studied extensively in AI for over two decades now. These circuits were initially proposed as "compiled objects," meant to facil…