It involves finding values to variables satisfying some constraints. If all constraints cannot be satisfied simultaneously, a solution is the assignment that best respects the constraints. While this problem is computationally intractable, many real problems can be modelled as constraint satisfaction.

  • Algorithms for Max-CSP and non-binary constraints.
  • Generic and symmetry-based heuristics.
  • Interleaved depth-first search.
  • Distributed constraint satisfaction.