Counterfactual explanation through constraint relaxation
Loading...
Files
Accepted Version
Date
2025-01-28
Authors
Gupta, Sharmi Dev
O'Sullivan, Barry
Quesada, Luis
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published Version
Abstract
Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints. A common approach to recover feasibility is to eliminate the constraints that cause the conflicts in the system. This approach allows the system to provide an explanation as: “if the user is willing to drop some of their constraints, there exists a solution”. However, this form of explanation might not be very informative. A counterfactual explanation is a type of explanation that can provide a basis for the user to recover feasibility by helping them understand what changes can be applied to their existing constraints rather than removing them. We propose an iterative method based on conflict detection and maximal relaxations in over-constrained constraint satisfaction problems to help compute a counterfactual explanation. We have evaluated our approach using well known instances that occur in industrial applications and demonstrated the relevance of multi-point relaxations.
Description
Keywords
Counterfactual explanation , Maximal relaxation , Constraint programming
Citation
Gupta, S.D., O’Sullivan, B. and Quesada, L. (2024) ‘Counterfactual explanation through constraint relaxation’, 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), Herndon, VA, USA, 28-30 October ,pp. 396–403. 2024 .Available at: https://doi.org/10.1109/ICTAI62512.2024.00064