|Deadline for abstract submissions||April 20, 2014|
|Deadline for paper submissions||April 27, 2014|
|Notifications to authors||May 18, 2014|
|Camera-ready copy submission||May 28, 2014|
Aims and Scope
Constraint Satisfaction Problems (CSPs) and Boolean Satisfiability Problems (SAT) have much in common. However, they also differ in many important aspects. Algorithmic techniques such as local search and propagation-based search have been applied in both areas, but with major differences in the underlying algorithmic design and in specific heuristics. Recently, the success of lazy clause-generating solvers has drawn significant attention, and can serve as one example of how the interaction between the two frameworks can advance the fields. Similarly, the comparative theoretical study of CSP and SAT is of great interest with a potential for many exciting results. The CSP and SAT communities, while to a large extent interacting with each other, are still mostly separate communities with separate conferences and meetings. This workshop is designed as a venue for bridging this gap, and enhancing cross-fertilization between the two communities, in terms of problems, ideas, techniques, and results.
This year's workshop is the fourth in the series, following successful occasions in SAT'11, SAT'12, and CP'13. We plan to continue to alternate this workshop between the CP and SAT conferences in order to better facilitate the purpose of cross-fertilization. As in previous years, the workshop is expected to consist of peer-reviewed contributed papers, an invited talk, a tutorial, and ample time for informal interaction.
Topics in the scope of the workshop include:
- Adaptation of CSP techniques to SAT problems.
- Adaptation of SAT techniques to CSP's.
- Efficient translations and encodings from one framework to the other, including SAT encodings of global constraints.
- Consistency criteria of SAT encodings.
- Lazy clause generation encodings and techniques.
- Heterogeneous CSP/SAT problems.
- Hybrid CSP/SAT solvers.
- Local search in CSP and SAT.
- Parallelization and real-time competition between CSP and SAT solvers, cross-talk between the solvers.
- Commonalities and differences in the theory of CSP and SAT solving.
- Intermediate problems (e.g., satisfiability modulo theories, pseudo-Boolean) and their relations to both CSP and SAT.
- Applications: ways to determine which framework works best for which application.
- Preprocessing techniques.
- Restart methods.
- Additional related topics.
Authors should prepare their papers in the LNCS/LNAI format, following Springer's instructions. Submissions can be of one of the following types:
- Full papers, maximum of 15 pages excluding references.
- Short papers, maximum of 5 pages excluding references.
Authors should indicate whether the submitted work has been published or accepted for publication elsewhere. Priority will be given to original full papers and to important work recently presented in other venues. Each submission should identify one contact author, and provide the email address and phone number of this author. Papers and abstracts should be submitted via EasyChair:
All submissions will be reviewed by at least two members of the program committee or their delegates. Decisions about acceptance or rejection will be made considering both the merit of the work and the available time for presentations. At least one author of each accepted submission must attend the workshop. Original papers will be published on the workshop website following the workshop.
- Yael Ben-Haim (IBM Research) - chair
- Nadia Creignou (Aix-Marseille Université)
- Alan Frisch (University of York)
- Enrico Giunchiglia (DIST - Univ. Genova)
- George Katsirelos (INRA, Toulouse)
- Valentin Mayer-Eichberger (NICTA and University of New South Wales) - chair
- Ian Miguel (University of St Andrews)
- Nina Narodytska (University of Toronto and University of New South Wales)
- Yehuda Naveh (IBM) - chair
- Steve Prestwich (Cork Constraint Computation Centre)
- Vadim Ryvchin (Technion)
- Meinolf Sellmann (IBM Research)
- Bart Selman (Cornell University)
- Ofer Strichman (Technion)
- Toby Walsh (NICTA and UNSW)