Bridging Constraint Satisfaction and Boolean Satisfiability

Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineering, including genetic improvement and combinatorial interaction testing.

• Introduction.- Background.- Solver Performance on Tractable CSPs: Empirical Evaluation.- SAT Encodings.- From CSP to SAT: Width Restrictions.- From CSP to SAT: Language Restrictions.- SAT Encodings of a Classical Problem: A Case Study.- Conclusions.