Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended algorithms and examples)
원문 초록
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way. An explanation here is a sequence of simple inference steps where simplicity is quantified using a cost function. The algorithms for explanation generation rely on extracting Minimal Unsatisfiable Subsets (MUS) of a derived unsatisfiable formula, exploiting a one-to-one correspondence between so-called non-redundant explanations and MUSs. However, MUS extraction algorithms do not provide any guarantee of subset minimality or optimality with respect to a given cost function. Therefore, we build on these formal foundations and tackle the main points of improvement, namely how to generate explanations efficiently that are provably optimal (with respect to the given cost metric). For that, we developed (1) a hitting set-based algorithm for finding the optimal constrained unsatisfiable subsets; (2) a method for re-using relevant information over multiple algorithm calls; and (3) methods exploiting domain-specific information to speed up the explanation sequence generation. We experimentally validated our algorithms on a large number of CSP problems. We found that our algorithms outperform the MUS approach in terms of explanation quality and computational time (on average up to 56 % faster than a standard MUS approach).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
RealFactBench: A Benchmark for Evaluating Large Language Models in Real-World Fact-Checking
LiTEx: A Linguistic Taxonomy of Explanations for Understanding Within-Label Variation in Natural Language Inference
Does Rationale Quality Matter? Enhancing Mental Disorder Detection via Selective Reasoning Distillation
SNAPE-PM: Building and Utilizing Dynamic Partner Models for Adaptive Explanation Generation
Rethinking Vision-Language Model in Face Forensics: Multi-Modal Interpretable Forged Face Detector
Target-Augmented Shared Fusion-based Multimodal Sarcasm Explanation Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.