Palahí i Sitges, Miquel (Date of defense: 2015-12-10)
In this thesis we focus on reformulate constraint satisfaction problems (CSP) into SAT Modulo Theories (SMT). SMT is an extension of SAT where the literals appearing in the formulas are not restricted ...
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 ...