• CIRCA Home
  
  
• Members
  
  
• Pre-prints
  
  
• Library
  
  
• Annual Reports
  
  
• Seminars
  
  
• Conferences
  
  
• Research
  
  
• Publicity
  
  
• Pictures
  
  
• GAP
  
  
• Webmail

Research in CIRCA

• Constraint Programming

Constraints are a natural, powerful means of representing and reasoning about combinatorial problems that impact all of our lives. For example, in the production of a university timetable many constraints occur, such as: the maths lecture theatre has a capacity of 100 students; art history lectures require a venue with a slide projector; no student can attend two lectures at once. Constraint solving offers a means by which solutions to such problems can be found automatically. Its simplicity and generality are fundamental to its successful application in a wide variety of disciplines, such as: scheduling; industrial design; aviation; banking; combinatorial mathematics; and the petrochemical and steel industries.

Related grants:


• Dominion