J.Pearson;Symmetry Breaking in Constraint Technology:Tools and Methods

Faculty of Engineering and Natural Sciences
FENS SEMINARS

Symmetry Breaking in Constraint Technology:
Tools and Methods

Justin Pearson

This talk will be an introduction to the problem of symmetry in combinatorial problem solving, in particular using Constraint Programming Technology.  Symmetry is a problem in combinatorial problem solving, because many symmetric parts of a search space can be explored before a solution is found. The activity of avoiding exploring too many symmetrically equivalent states is referred to as symmetry breaking.  Without some form of symmetry breaking it is often impossible to solve problems. In this talk I will give an overview of recent research into symmetry breaking within the constraint programming community.

April 29, 2005, 14:40-15:30, MDBF 2019