4 papers
Translating finite-domain integer constraint models to CP/SMT/ILP/PB/SAT solvers with CPMpy
Tias Guns, Ignace Bleukx, Hendrik Bierlee +8
Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems. The user specifies their problem through constraints and decision var…
Using Certifying Constraint Solvers for Generating Step-wise Explanations
Ignace Bleukx, Maarten Flippo, Bart Bogaerts +2
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 ex…
Exploiting Symmetries in MUS Computation (Extended version)
Ignace Bleukx, Hélène Verhaeghe, Bart Bogaerts +1
In eXplainable Constraint Solving (XCS), it is common to extract a Minimal Unsatisfiable Subset (MUS) from a set of unsatisfiable constraints. This helps explain to a user why a co…
Trustworthy and Explainable Decision-Making for Workforce allocation
Guillaume Povéda, Ryma Boumazouza, Andreas Strahl +7
In industrial contexts, effective workforce allocation is crucial for operational efficiency. This paper presents an ongoing project focused on developing a decision-making tool de…