2 papers
cs.AI2026
Towards Bound Consistency for the No-Overlap Constraint Using MDDs
Amaury Guichard, Laurent Michel, Hélène Verhaeghe +1
Achieving bound consistency for the no-overlap constraint is known to be NP-complete. Therefore, several polynomial-time tightening techniques, such as edge finding, not-first-not-…
cs.AI2025
CP-Model-Zoo: A Natural Language Query System for Constraint Programming Models
Augustin Crespin, Ioannis Kostis, Hélène Verhaeghe +1
Constraint Programming and its high-level modeling languages have long been recognized for their potential to achieve the holy grail of problem-solving. However, the complexity of…