Symmetry in Combinatorial Search

Title: Symmetry in Combinatorial Search
Speaker: Toby Walsh (NICTA and UNSW)
Time: 10:00am, Friday, July 20th, 2012
Venue: Lecture Room, 3rd Floor, Building 5#, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences
Abstract: Symmetry has played an important role in many areas of artificial intelligence including constraint programming, satisfiability, planning, and automated reasoning.

In this talk, I will describe recent work on formalizing and using symmetry. My talk will contain a minimum of group theory but will hopefully equip you with the tools to study symmetries within your domain of interest. I will show how such symmetry can speed up reasoning, and has led to the discovery of new results in both graph and number theory.

Short Biography:
Toby Walsh is a Research Group Leader of NICTA, adjunct Professor at the University of New South Wales, external Professor at Uppsala University and an honorary fellow of Edinburgh University. He has been elected a fellow of both AAAI and ECCAI. He is an Editor of the Handbook for Constraint Programming, and of the Handbook for Satisfiability. He has been Conference and/or Program Chair of the CP, SAT, IJCAR and IJCAI conferences.