Compiling constraint satisfaction problems

摘要

Many tasks requiring intelligence, in particular scheduling and planning, must be solved under time constraints. This is difficult to achieve because of the combinatorial nature of such tasks. While search heuristics can give good average performance, they cannot give any performance guarantees for a particular instance. Fortunately, the tasks are often very similar. Therefore, compiling partial solutions is one way in which better performance guarantees for on-line problem solving could be achieved.