6th International Workshop on the Cross-Fertilization Between CSP and SAT
                     In conjunction with SAT 2016
                          Bordeaux, France
                            July 4, 2016

Important Dates

  • Deadline for abstract submissions May 2, 2016
  • Deadline for paper submissions May 9, 2016
  • Notifications to authors May 27, 2016
  • Camera-ready copy June 15, 2016
  • CSPSAT Workshop July 4, 2016

Overview and Scope

Constraint Satisfaction Problems (CSP’s) and Boolean Satisfiability Problems (SAT) have much in common. However, they also differ in many important aspects, which result in major differences in solution techniques. More importantly, the CSP and SAT communities, while to some extent interacting with each other, are mostly separate communities with separate conferences and meetings. This workshop is designed as a venue for bridging the gap and for cross-fertilization between the two communities, in terms of ideas, problems, techniques, and results.

The workshop is the sixth in the series, following successful occasions in SAT’11, SAT’12, CP’13, SAT’14, and CP’15. We alternate this workshop between CP and SAT conferences.

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
  • Heterogeneous CSP/SAT problems
  • Hybrid CSP/SAT solvers
  • Heuristics in CSP and SAT
  • 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


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 also 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. Abstracts and papers should be submitted via EasyChair: CSPSAT 2016 Submission at 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.

Organizing Committee

Yael Ben-Haim, IBM Research
Valentin Mayer-Eichberger
Yehuda Naveh, IBM Research

Program Committee

  • Yael Ben-Haim, IBM Research, Israel
  • Alan Frisch, University of York
  • Graeme Gange, University of Melbourne
  • Enrico Giunchiglia, University of Genova, Italy
  • George Katsirelos, INRA, France
  • Valentin Mayer-Eichberger, NICTA and University of New South Wales, Australia
  • Ian Miguel, University of St Andrews, UK
  • Nina Narodytska, Carnegie Mellon University, USA
  • Yehuda Naveh, IBM Research, Israel
  • Justyna Petke, University College London, UK
  • Steve Prestwich, University College Dublin, Ireland
  • Ofer Strichman, Technion, Israel
  • Toby Walsh, NICTA and University of New South Wales, Australia