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 generating explanations, detecting decision bias and evaluating counterfactual queries. Prime implicants of the complete reason are known as sufficient reasons for the decision and they correspond to what is known as PI explanations and abductive explanations. In this paper, we refer to the prime implicates of a complete reason as necessary reasons for the decision. We justify this terminology semantically and show that necessary reasons correspond to what is known as contrastive explanations. We also study the computation of complete reasons for multi-class decision trees and graphs with nominal and numeric features for which we derive efficient, closed-form complete reasons. We further investigate the computation of shortest necessary and sufficient reasons for a broad class of complete reasons, which include the derived closed forms and the complete reasons for Sentential Decision Diagrams (SDDs). We provide an algorithm which can enumerate their shortest necessary reasons in output polynomial time. Enumerating shortest sufficient reasons for this class of complete reasons is hard even for a single reason. For this problem, we provide an algorithm that appears to be quite efficient as we show empirically.
Beyond Sufficiency: Time Series Explanation with Counterfactual Necessity
School of Computer Science, University of Bristol(布里斯托大学计算机科学学院);School of Engineering Mathematics and Technology, University of Bristol(布里斯托大学工程数学与技术学院)
Explanation Design in Strategic Learning: Sufficient Explanations That Induce Non-harmful Responses
CISPA Helmholtz Center for Information Security(CISPA海德堡信息安全中心);Mizuho–DL Financial Technology, Co., Ltd.(Mizuho-DL金融科技有限公司);University of Michigan(密歇根大学);Saarland University(萨尔兰州大学)