"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib...