Constraint Programming for Probabilistic Reasoning and Compiler Optimization

约束规划是解决困难问题的强大框架。在约束规划方法中，人们通过在可接受的解决方案上说明约束来对问题进行建模。一旦建立了模型，就可以使用各种算法（通常基于搜索）来求解模型。有许多有趣的任务特别适合这种方法，包括排序、调度和计划。这些任务的共同点是约束是问题的自然组成部分。一个很好的例子是调度人员或机器。现成的条件是有限制的，比如一个工人一周只能在特定的时间工作，或者只能做特定的工作。

Constraint programming is a powerful framework for solving difficult problems. In the constraint programming methodology, one models a problem by stating constraints on acceptable solutions. Once a model has been formulated, various algorithms---usually based on search---are available for solving the model. There are many interesting tasks for which this approach is particularly suited, including sequencing, scheduling, and planning. What these tasks have in common is that constraints are a natural part of the problem. A good example is scheduling people or machines. What is readily available are constraints such as a worker is only available for certain parts of the week or only able to do certain jobs.