CSPSAT 2015 Workshop


Call for Papers and Participation

Fifth International Workshop on the Cross-Fertilization Between CSP and SAT
In conjunction with CP 2015

Cork, Ireland
August 31, 2015

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, alternating between CP and SAT conferences, is the fifth in the series. It follows successful occasions at SAT'11, SAT'12, CP'13, and SAT'14.

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
  • 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
  • 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 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:

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.

Important Dates

Deadline for abstract submissions June 12, 2015
Deadline for paper submissions June 17, 2015
Notifications to authors July 5, 2015
Camera-ready copy July 22, 2015
CSPSAT Workshop August 31, 2015

Invited Speaker

There are no CNF problems,
Peter Stuckey, University of Melbourne and NICTA


ASP in a nutshell,
Torsten Schaub, University of Potsdam


9:00 - 10:00 Tutorial: ASP in a nutshell,
Torsten Schaub, University of Potsdam
10:00 - 10:30 Coffee Break
10:30 - 11:30 Invited Talk: There are no CNF problems,
Peter Stuckey, University of Melbourne and NICTA
11:30 - 13:30 Lunch Break
13:30 - 14:00 Solving Graph Coloring Problems with Abstraction and Symmetry,
Michael Codish, Michael Frank, Avraham Itzhakov and Alice Miller
14:00 - 14:30 Provably Pointless Propagator Calls,
Christopher Jefferson, Karen Petrie and David Cohen
14:30 - 15:00 Interface Reconciliation in Kahn Process Networks using CSP and SAT,
Pavel Zaichenkov, Olga Tveretina and Alex Shafarenko

Organizing Committee

Program Committee

  • Yael Ben-Haim, IBM Research, Israel
  • Alan Frisch, University of York, UK
  • 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
  • Steve Prestwich, University College Dublin, Ireland
  • Bart Selman, Cornell University, USA
  • Ofer Strichman, Technion, Israel
  • Toby Walsh, NICTA and University of New South Wales, Australia