Promoting robust black-box solvers through competitions

Authors:
Christophe Lecoutre;Olivier Roussel;M. R. Dongen
Affiliations:
CRIL--CNRS UMR 8188, Université Lille-Nord de France, Artois, Lens, France 62307;CRIL--CNRS UMR 8188, Université Lille-Nord de France, Artois, Lens, France 62307;Computer Science Department, University College Cork, Cork, Ireland
Venue:
Constraints
Year:
2010

Citing 6
Cited 1

Dual viewpoint heuristics for binary constraint satisfaction problems

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Partition search for non-binary constraint satisfaction

Information Sciences: an International Journal
MINION: A Fast, Scalable, Constraint Solver

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Beyond Singleton Arc Consistency

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Compiling finite linear CSP into SAT

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Modeling view selection as a constraint satisfaction problem

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.