Using Certifying Constraint Solvers for Generating Step-wise Explanations
Year: 2026
Type: other
Abstract: In the field of Explainable Constraint Solving, it is common to explain to a user why a problem is unsatisfiable. A recently proposed method for this is to compute a sequence of explanation steps. Such a step-wise explanation shows individual reasoning steps involving constraints from the original problem specification, that in the end explain the conflict. However, computing a step-wise explanation is computationally expensive, limiting the scale of problems on which it can be used. We investigate how we can use proofs generated by a constraint solver as a starting point for computing step-wise explanations, instead of computing them step-by-step. More specifically, we define a framework of abstract proofs, in which both proofs and step-wise explanations can be represented. We then propose several methods for converting a proof to a step-wise explanation sequence, with special attention to trimming and simplification techniques to keep the sequence and its individual steps small. Our results show our method significantly speeds up the generation of step-wise explanation sequences, while the resulting step-wise explanation has a quality similar to the current state-of-the-art.
Source: Underline Science Inc.
DOI: 10.48448/qmmf-1e37
Institutions: KU Leuven, Delft University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: unsatisfiability proofs, proof simplification
Open Access status: green
OpenAlex ID: W7128737352
