Thursday, July 16

MS57
Constraint Processing Over Intervals

2:00 PM-4:00 PM
Room: Sidney Smith 2106

Recent work in constraint programming has led to novel interval methods techniques combining techniques methods from artificial intelligence and numerical analysis. These methods can produce orders of magnitude improvement in efficiency. They are especially appropriate for small-scale highly non-linear problems or for problems where it is important to prove the absence of solutions or to count the number of solutions, as is becoming more frequent in chemical engineering.

The speakers in this minisymposium will describe the state-of-the-art in interval constraint programming and discuss providing robust and effective solutions.

2:00 Some Experiments with Interval Constraints

Fr�d�ric Benhamou, IRIN - Universit� de Nantes, France

2:30 Simple Interval Based Propagation Techniques

Jean-Francois Puget and P. Charman, Ilog SA, France

3:00 Consistency Techniques in Ordinary Differential Equations

Yves Deville and Micha Janssen, Université Catholique de Louvain, Belgium; and Pascal Van Hentenryck, Brown University