Faculty of Engineering and Natural Sciences
Static and Dynamic Symmetry Breaking for Constraint Satisfaction Problems
Constraint Programming is a wide framework for specifying combinatorial optimisation problems. The constraint programming framework allows a clean separation between problem specification and the specification of search procedures. Recently much research has focused on symmetry breaking of Constraint Satisfaction problems. By breaking the symmetry of a problem the symmetric parts of the search space are removed hence reducing solving time.
In this talk I will explain two recent developments in dynamic and static symmetry breaking for certain classes of variable and value symmetries.
18 Oct, 2006 Wednesday, 13:40, FENS G035