Reformulation of constraint models into SMT 

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 to contain only ...