Aircraft Scheduling, DNA Sequencing and Sudoko - Solving Constraint Satisfaction Problems in Java

Have you ever tried to schedule a meeting for a group of busy persons with lots of agenda constraints, solve a crossword or Sudoku puzzle or optimally allocate scarce resources to activities? If so, you have, consciously or unconsciously, been dealing with a Constraint Satisfaction Problem. Typically, these problems require some form of human intelligence to be solved adequately, and cannot be solved automatically by straight-forward algorithms within an acceptable amount of time. This presentation will show you an effective way to solve these problems and examples of how to implement it in Java.
Constraint Satisfaction Problems (CSPs) are, at their core, complex search problems which are stated in terms of variables, their domains and constraints on those variables.

After having attended this presentation, the audience will:
• know the theory behind CSPs and their solution strategies;
• be able to recognize a CSP when it encounters one;
• be able to model a non-complex problem as a CSP;
• be able to solve a non-complex CSP using a Java CSP framework;
• know the theory behind Constraint Relaxation.