Constriant programming is both an interesting research area and a useful and powerful tool for solving many mathematical and real-world problems.
The following is an (incomplete) list of the research projects in
constraint programming undertaken at York:
The Automated Generation of Constraint Programs
(Including the ESSENCE problem specification language,
the ESSENCE' constraint modelling language and
the CONJURE automated modelling system.)
Modelling Combinatorial Problems in Satisfiability Modulo Theories (SMT)
The Automatic Generation of Implied Constraints
(Including all our work on symmetry-breaking constraints.)
Solving Non-Boolean Satisfiability Problems
(Including NB-Walksat and code for downloading)
Gridline: The allocation of grid computing resources
This web-page is maintained by
and was last updated 14 June 2011.