Overview and Scope
Constraint Satisfaction Problems (CSP) and Boolean Satisfiability Problems (SAT) have much in common. However, they also differ in many important aspects, leading to 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.
- Topics in the scope of the workshop include (but not limited to):
- Adaptation of CSP techniques to SAT problems
- Adaptation of SAT techniques to CSP problems
- Efficient translations and encodings from one framework to the other
- Heterogeneous CSP/SAT problems
- Hybrid CSP/SAT solvers
- Heuristics in SAT and CSP
- 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
The workshop is the seventh in the series, alternating between CP and SAT conferences. Previous instances took place in SAT'11, SAT'12, CP'13, SAT’14, and CP’15.
Submissions
We invite the following forms of submissions:
- Short tutorial presentations The submission should be a proposal that includes an outline of the tutorial. The number of accepted tutorials depends on the overall number of accepted talks, with the aim to set up a balanced workshop program.
-
Reports on already published work
The submission should be an extended talk abstract that includes an outline of the planned talk, and pointers to relevant bibliography. -
Reports on work-in-progress
The submission should be an extended talk abstract that includes an outline of the planned talk.
The submissions of extended abstracts will be managed via Easychair. Each submission should have an overall length of 1-4 pages in LNCS format. The accepted extended abstracts will be published on the workshop webpage.
At least one author of each accepted submission must attend the workshop.
We are looking forward to a successful workshop, and to seeing you in Oxford!
Important Dates
| Submissions: | April 15 |
| Notification: | May 08 |
| Camera-Ready Version: | May 25 |
| CSPSAT Workshop: | July 07 |
Program
TBD
Organizing Committee
Alexander Ivrii, IBM
alexi@il.ibm.com
Yehuda Naveh, IBM
naveh@il.ibm.com