We explore the problem of step-wise explaining how to solve constraint satisfaction
problems, with a use case on logic grid puzzles. More specifically, we study the problem of …

Debugging unsatisfiable constraint models can be a tedious task. Current tools allow a user
to extract a subset of constraints that render the problem unsatisfiable (MUS). However, in …

SAT and propagation solvers often underperform for optimisation models whose objective
sums many single-variable terms. MaxSAT solvers avoid this by detecting and exploiting …

Cluster managers like Kubernetes and OpenStack are notoriously hard to develop, given
that they routinely grapple with hard combinatorial optimization problems like load …

Real-world semantic or knowledge-based systems can become large and complex, eg, in
the biomedical domain. Tool support for the localization and repair of faults within …

Given the preferences of several agents over a set of alternatives, there may be competing
views on which of the alternatives would be the" best" compromise. We propose a formal …

As the complexity and scope of VLSI designs continue to grow, fault detection processes in
the pre-silicon stage have become crucial to guaranteeing reliability in IC design. Most fault …

The explanation of infeasibilities formed in Minimal Unsatisfiable Subformulas (MUSes) is a
core task in the analysis of over-constrained Boolean formulas. A wide range of applications …

Decision systems for solving real-world combinatorial problems must be able to report
infeasibility in such a way that users can understand the reasons behind it, and understand …

In this paper, we present Demystify, a general tool for creating human-interpretable step-by-
step explanations of how to solve a wide range of pen and paper puzzles from a high-level …