Constraint programming: Difference between revisions

Revision as of 10:31, 15 February 2006

Revision as of 08:57, 9 March 2006

Line 60:

Predicate '''labeling''' starts the depth first search: it takes the first value in the ___domain of the first variable, and assigns it to the variable. Then, the [[AC-3 algorithm]] is resumed and performs further ___domain reductions. If one ___domain becomes empty, '''labeling''' backtracks and tries the second value in the ___domain of the first variable. Otherwise, it tries the first value in the ___domain of the second variable, and so on, until a solution is found.

==References See also ==

* [[Minimum remaining values]]

* [[Forward checking]]

==External links==

*[http://pubsonline.informs.org/feature/pdfs/0092.2102.01.3106.29.pdf Program Does Not Equal Program: Constraint Programming and its Relationship to Mathematical Programming]

*[http://kti.ms.mff.cuni.cz/~bartak/constraints/index.html On-Line Guide to Constraint Programming]

[[Category:Logic programming]]