This Article 
 Bibliographic References 
 Add to: 
Constraint Programming in Sweden
March/April 2009 (vol. 24 no. 2)
pp. 87-89
Pierre Flener, Uppsala University
Mats Carlsson, Swedish Institute of Computer Science
The authors survey the research and development in Sweden in constraint programming, which is rapidly becoming the method of choice for some kinds of constraint problems, such as scheduling and configuration.

1. P. Baptiste, C. Le Pape, and W. Nuijten, Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, Kluwer Academic Publishers, 2001.
2. E.C. Freuder and M. Wallace, "Constraint Technology and the Commercial World," IEEE Intelligent Systems, vol. 15, no. 1, 2000, pp. 20–23.
3. E.C. Freuder and M. Wallace, "Constraint Programming," Search Methodologies, E.K. Burke, and G. Kendall eds., Springer, 2005, ch. 9, pp. 239–272.
4. F. Rossi, P. van Beek, and T. Walsh eds., , Handbook of Constraint Programming, Elsevier, 2006.
5. P. Van Hentenryck et al., "Strategic Directions in Constraint Programming," ACM Computing Surveys, vol. 28, no. 4, 1996, pp. 701–726.
6. M. Wallace, "Constraint Programming: The Paradigm to Watch," Constraint Programming Letters, vol. 1, 2007, pp. 7–13.

Index Terms:
constraint programming, constraint-based local search, Sweden, SICStus Prolog, Gecode
Pierre Flener, Mats Carlsson, Christian Schulte, "Constraint Programming in Sweden," IEEE Intelligent Systems, vol. 24, no. 2, pp. 87-89, March-April 2009, doi:10.1109/MIS.2009.25
Usage of this product signifies your acceptance of the Terms of Use.