Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...

Abstract: Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment) ...

Constraint programming combined with machine learning provides a robust framework for addressing complex combinatorial problems across diverse domains such as energy management, production scheduling ...

Abstract: HAL is a new constraint logic programming language specifically designed to support construction of and experimentation with constraint solvers. One of the most important constraint solvers ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...