First Year Viva

1
First Year Viva

• By Chris Unsworth

2
What I have done

• Developed Specialised constraints for stable
  matching problems
• What is a specialised constraint?
• What is the difference between global constraints
  and specialised constraints?

3
What I have done

• What they have in common
• Designed to work within an AC algorithm
• The implementation depends on the class of AC
  algorithm
• Fine grained returns support information
• Course grained propagates then returns true if
  a value is removed
• Generic returns list of unsupported values
• Constraint toolkits remove unsupported values
  directly

4
What I have done

• What is a global constraint
• A primitive or toolbox constraint
• Constrains n variables
• Global constraint include
• AllDifferent
• Lex
• NotAllEqual
• NValue

5
What I have done

• What is a specialised constraint?
• Problem specific constraint
• Can be any arity
• Most specialised constraints are in the area of
  scheduling such as
• Edge finding
• Energetic rules
• Network flows

6
What I am doing

• Starting 17th October 2005
• Check implementation of all CP SM models,
  including
• FT, Bool, DG1, DG2, SM2 and SMN
• Get a reasonable implementation of the EGS
  algorithm in Java
• Design, run and tabulate an empirical study of
  the above models
• Starting November 2005
• Check implementation of SMTI2
• Implement SMTIN
• Recreate ECAI 02 experiments and include the new
  models
• Increase the instance sizes to explore the limits
  of the new solutions
• Write up the work with a view to submitting to
  ECAI 06 (deadline for summaries 8th February 2006)

7
What I am doing

• Starting January 2006
• Implement the optimal version of HRN
• Implement HRTI2 and HRTIN
• Test both models on the SPA data sets
• Implement HRC2 and HRCN (HR with couples)
• Implement HRTIC2 and HRTICN
• Design and run an empirical study including all
  CP HR models
• Compare HR Constraints to SM constraints on SM
  instances

8
What I am doing

• Starting March 2006
• Develop specialised constraints for many to many
  stable matching problems

9
What I am going to do

• Provisional thesis statement
• Specialised constraints for stable matching
  problems significantly outperform more
  traditional toolbox constraint solutions whilst
  maintaining their versatility