Constraints

, Volume 15, Issue 3, pp 317–326 | Cite as

Promoting robust black-box solvers through competitions

  • Christophe Lecoutre
  • Olivier Roussel
  • M. R. C. van Dongen
Viewpoints

Abstract

This paper presents the experiences of the organizers of the four constraint solver competitions which were held in conjunction with CP in the previous years. The paper mainly focuses on the competitions which were held in 2008 and 2009, outlines the reasons for organizing the competitions, describes how the solvers were evaluated, and presents lessons, observations, and general trends.

Keywords

Solver competition Experimental evaluation Robust constraint solvers Black-box 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baptista, L., Lynce, I., & Marques-Silva, J. P. (2001). Complete search restart strategies for satisfiability. In Proceedings of SSA’01 workshop held with IJCAI’01.Google Scholar
  2. 2.
    Boussemart, F., Hemery, F., Lecoutre, C., & Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of ECAI’04 (pp. 146–150).Google Scholar
  3. 3.
    Carlsson, M. (2006). Filtering for the case constraint. Talk given at the School on Global Constraints.Google Scholar
  4. 4.
    Cheng, K., & Yap, R. (2008). Maintaining generalized arc consistency on ad-hoc r-ary constraints. In Proceedings of CP’08 (pp. 509–523).Google Scholar
  5. 5.
    Cheng, K., & Yap, R. (2008). An overview of mddc-solve. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 3–7).Google Scholar
  6. 6.
    Correia, M., & Barahona, P. (2008). Overview of the CaSPER constraint solvers. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 15–24).Google Scholar
  7. 7.
    Fukunaga, A. S. (2003). Complete restart strategies using a compact representation of the explored search space. In Proceedings of SSA’03 workshop held with IJCAI’03.Google Scholar
  8. 8.
    Geelen, P. A. (1992). Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings of ECAI’92 (pp. 31–35).Google Scholar
  9. 9.
    Gent, I. P., Jefferson, C., & Miguel, I. (2006). Minion: A fast, scalable constraint solver. In Proceedings of ECAI’06 (pp. 98–102).Google Scholar
  10. 10.
    Gomes, C., Selman, B., Crato, N., & Kautz, H. (2000). Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24, 67–100.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Grimes, D. (2008). A comparison of boosted versus unboosted weighted degree search. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 25–30).Google Scholar
  12. 12.
    Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263–313.CrossRefGoogle Scholar
  13. 13.
    Hebrard, E. (2008). Mistral, a constraint satisfaction library. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 31–39).Google Scholar
  14. 14.
    Hebrard, E. (2008). Implementing a constraint solver: A case study. In Slides of the workshop of the third international constraint solver competition. http://www.cril.univ-artois.fr/CPAI08.
  15. 15.
    Lecoutre, C. (2008). Optimization of simple tabular reduction for table constraints. In Proceedings of CP’08 (pp. 128–143).Google Scholar
  16. 16.
    Lecoutre, C., Sais, L., Tabary, S., & Vidal, V. (2007). Recording and minimizing nogoods from restarts. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 1, 147–167.Google Scholar
  17. 17.
    O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., & O’Sullivan, B. (2008). Using case-based reasoning in an algorithm portfolio for constraint solving. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 53–62).Google Scholar
  18. 18.
    Prosser, P., Stergiou, K., & Walsh, T. (2002). Singleton consistencies. In Proceedings of CP’00 (pp. 353–368).Google Scholar
  19. 19.
    Puget, J. F. (2004). Constraint programming next challenge: Simplicity of use. In Proceedings of CP’04 (pp. 5–8). Invited talk.Google Scholar
  20. 20.
    Refalo, P. (2004). Impact-based search strategies for constraint programming. In Proceedings of CP’04 (pp. 557–571).Google Scholar
  21. 21.
    Roussel, O., & Lecoutre, C. (2009). XML representation of constraint networks: Format XCSP 2.1. Technical report. arXiv:0902.2362. CoRR.
  22. 22.
    Sanchez, M., Bouveret, S., de Givry, S., Heras, F., Jegou, P., Larrosa, J., et al. (2008). Max-CSP competition 2008: Toulbar2 solver description. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 63–70).Google Scholar
  23. 23.
    Tamura, N., Taga, A., Kitagawa, S., & Banbara, M. (2006). Compiling finite linear CSP into SAT. In Proceedings of CP’06 (pp. 590–603).Google Scholar
  24. 24.
    Tamura, N., Tanjo, T., & Banbara, M. (2008). System description of a SAT-based CSP solver: Sugar. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 71–75).Google Scholar
  25. 25.
    The Choco Team. Choco: An open source Java constraint programming library. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 8–14).Google Scholar
  26. 26.
    Ullmann, J. R. (2007). Partition search for non-binary constraint satisfaction. Information Science, 177, 3639–3678.MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    van Dongen, M. R. C. (2006). Beyond singleton arc consistency. In Proceedings of ECAI’06 (pp. 163–167).Google Scholar
  28. 28.
    van Dongen, M. R. C., Lecoutre, C., & Roussel, O. (Eds.) (2008). Proceedings of the third constraint solver competition. http://www.cril.univ-artois.fr/CPAI08/Competition-08.pdf.
  29. 29.
    Zhou, N.-F. (2008). bp-solver 2008. In M. R. C. van Dongen, C. Lecoutre, & O. Roussel (Eds.), Proceedings of the third constraint solver competition (pp. 83–90).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Christophe Lecoutre
    • 1
  • Olivier Roussel
    • 1
  • M. R. C. van Dongen
    • 2
  1. 1.CRIL—CNRS UMR 8188Université Lille-Nord de France, ArtoisLensFrance
  2. 2.Computer Science DepartmentUniversity College CorkCorkIreland

Personalised recommendations