Promoting robust black-box solvers through competitions

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.

[1]  Julian R. Ullmann,et al.  Partition search for non-binary constraint satisfaction , 2007, Inf. Sci..

[2]  Thomas Schiex,et al.  Max-CSP competition 2008: toulbar2 solver description , 2008 .

[3]  Christophe Lecoutre.  XML Representation of Constraint Networks , 2010 .

[4]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[5]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[6]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[7]  Matt Brown,et al.  Invited talk , 2007 .

[8]  A. Fukunaga.  Complete Restart Strategies Using a Compact Representation of the Explored Search Space , 2007 .

[9]  Lakhdar Sais,et al.  Recording and Minimizing Nogoods from Restarts , 2007, J. Satisf. Boolean Model. Comput..

[10]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[11]  Jean-François Puget,et al.  Constraint Programming Next Challenge: Simplicity of Use , 2004, CP.

[12]  Ian P. Gent,et al.  Minion: A Fast Scalable Constraint Solver , 2006, ECAI.

[13]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

[14]  Olivier Roussel,et al.  XML Representation of Constraint Networks: Format XCSP 2.1 , 2009, ArXiv.

[15]  Roland H. C. Yap,et al.  Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints , 2008, CP.

[16]  Joao Marques-Silva,et al.  Complete Search Restart Strategies for Satisfiability , 2001 .

[17]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[18]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[19]  Christophe Lecoutre.  Optimization of Simple Tabular Reduction for Table Constraints , 2008, CP.

[20]  Marc R. C. van Dongen.  Beyond Singleton Arc Consistency , 2006, ECAI.

[22]  Toby Walsh,et al.  Singleton Consistencies , 2000, CP.

[23]  Mutsunori Banbara,et al.  Compiling Finite Linear CSP into SAT , 2006, CP.