3 papers
cs.AI2026
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…
cs.AI2024
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…
cs.AI2024
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…