Revision as of 02:47, 16 March 2025 edit Giftlite (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,854 edits →Dynamic programming: wlnk ← Previous edit		Latest revision as of 10:26, 27 May 2025 edit undo GreenC bot (talk \| contribs) Bots 3,053,580 edits Reformat 1 archive link. Wayback Medic 2.5 per WP:URLREQ#citeftp
Line 79: [[Constraint propagation]] in [[Constraint Satisfaction Problems\|constraint satisfaction problems]] is a typical example of a refinement model, and formula evaluation in [[spreadsheet]]s are a typical example of a perturbation model. The refinement model is more general, as it does not restrict variables to have a single value, it can lead to several solutions to the same problem. However, the perturbation model is more intuitive for programmers using mixed imperative constraint object-oriented languages.<ref>Lopez, G., Freeman-Benson, B., & Borning, A. (1994, January). [ftp://trout.cs.washington.edu/tr/1993/09/UW-CSE-93-09-04.pdf Kaleidoscope: A constraint imperative programming language.]{{dead link\|date=May 2025\|bot=medic}}{{cbignore\|bot=medic}} In ''Constraint Programming'' (pp. 313-329). Springer Berlin Heidelberg.</ref> ==Domains==

Constraint programming: Difference between revisions