Constraint programming: Difference between revisions

Revision as of 14:20, 25 November 2005

Revision as of 18:05, 2 December 2005

Line 41:

==Finite Domain==

Finite Domains is one of the most successful domains of Constraint Programming. In some areas (like [[Operations research|Operations Research]]) Constraint Programming is often identified with Constraint Programming over Finite Domains.

Finite ___domain solvers are useful for solving [[Constraint satisfaction problem|Constraint satisfaction problems]], and are often based on Arc-Consistency (see [[AC-3 algorithm]]), or one of its approximations.