A satisfiability modulo theories approach to constraint programming 

Suy Franch, Josep (Date of defense: 2012-12-20)

In this thesis we focus on solving CSPs using SMT. Essentially, what we do is reformulating CSPs into SMT. The obtained results allow us to conclude that state-of-the-art SMT solvers are a robust tool to solve CSPs. We ...