CSPSAT 2015 - Fifth International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT 2015)
Topics/Call fo Papers
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.
Last modified: 2015-05-13 06:44:00