Preference Elicitation for Step-Wise Explanations in Logic Puzzles
Marco Foschini, Marianne Defresne, Emilio Gamba, Bart Bogaerts, Tias Guns

TL;DR
This paper explores interactive preference elicitation for step-wise explanations in logic puzzles, proposing normalization and a novel query strategy to improve explanation quality based on user preferences.
Contribution
It introduces MACHOP, a new query generation method, and normalization techniques to better learn user preferences for explanations in logic puzzles.
Findings
MACHOP outperforms standard methods in explanation quality.
Normalization techniques stabilize learning across multiple sub-objectives.
Effective preference elicitation improves explanation comprehensibility.
Abstract
Step-wise explanations can explain logic puzzles and other satisfaction problems by showing how to derive decisions step by step. Each step consists of a set of constraints that derive an assignment to one or more decision variables. However, many candidate explanation steps exist, with different sets of constraints and different decisions they derive. To identify the most comprehensible one, a user-defined objective function is required to quantify the quality of each step. However, defining a good objective function is challenging. Here, interactive preference elicitation methods from the wider machine learning community can offer a way to learn user preferences from pairwise comparisons. We investigate the feasibility of this approach for step-wise explanations and address several limitations that distinguish it from elicitation for standard combinatorial problems. First, because the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Data Visualization and Analytics · Constraint Satisfaction and Optimization
