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.