Constraint Programming Letters Special Issue on “Autonomous Search”

Call for Papers


Deadline for paper submission (provisional): June 15th, 2008 July 6th 2008


Guest Editors


Youssef Hamadi, Microsoft Research Cambridge,

Eric Monfroy, Université de Nantes/UTFSM Valparaiso,

Frederic Saubion, Université d’Angers.



General Information


Recent progresses in the processing of combinatorial problems have demonstrated that search algorithms can become extremely efficient when they take advantage of previous attempts to drive their exploration. For instance in modern DPLLs, the collect of conflicts feeds the variable selection heuristic, and the quality of unit propagation controls the use of the restart strategy. These implicit uses of closed control loops have been empirically discovered by the SAT community. We believe that a more principled and autonomous approach for search efficiency has to be started in CSP and Constraint Programming. The purpose of this special issue is to present recent attempts in the design of autonomous solvers, therefore works coming from different communities are especially welcomed.





Typical topics include, but are not limited to:




Review criteria


Papers will be reviewed by an international committee according to the following criteria:




Submission procedure


All the papers should be full journal length versions and follow the guidelines set out by CPL. All the papers will be peer reviewed following the CPL reviewing procedures. The guide for authors can be found here:


Authors should send a pdf file to



Expected agenda 




About CPL


Constraint Programming Letters (CPL) provides an international forum for the electronic publication of high-quality scholarly articles on constraint programming. All published papers are freely available online. The goal of CPL is to promote and nurture constraint programming research, report on its successful applications, and encourage cross-fertilization with neighbouring areas.