DUGi

Solving constraint satisfaction problems with SAT modulo theories

http://dugi.udg.edu/item/http:@@@@hdl.handle.net@@10256@@12645

Due to significant advances in SAT technology in the last years, its use for solving constraint satisfaction problems has been gaining wide acceptance. Solvers for satisfiability modulo theories (SMT) generalize SAT solving by adding the ability to handle arithmetic and other theories. Although there are results pointing out the adequacy of SMT solvers for solving CSPs, there are no available tools to extensively explore such adequacy. For this reason, in this paper we introduce a tool for translating FLATZINC (MINIZINC intermediate code) instances of CSPs to the standard SMT-LIB language. We provide extensive performance comparisons between state-of-the-art SMT solvers and most of the available FLATZINC solvers on standard FLATZINC problems. The obtained results suggest that state-of-the-art SMT solvers can be effectively used to solve CSPs

This is an extended version of a short paper [8] presented at the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010) in Edinburgh, UK. Research partially supported by the Spanish MICINN under grant TIN2008-04547

Springer Verlag