Solving constraint satisfaction problems with SAT modulo theories

​
orcId Bofill Arasa, Miquel​ researcherId Bofill Arasa, Miquel​ scopusId Bofill Arasa, Miquel​ ​
Bofill Arasa, Miquel
​ ​ scopusId Palahí i Sitges, Miquel​ ​
Palahí i Sitges, Miquel
orcId Suy Franch, Josep​ ​ scopusId Suy Franch, Josep​ ​
Suy Franch, Josep
orcId Villaret i Ausellé, Mateu​ ​ scopusId Villaret i Ausellé, Mateu​ ​
Villaret i Ausellé, Mateu
Full Text
SolvingConstraintSatisfaction.pdf embargoed access ​
Request a copy
Request a copy
When filling the form you are requesting a copy of the article, that is deposited in the institutional repository (DUGiDocs), at the autor or main autor of the article. It will be the same author who decides to give a copy of the document to the person who requests it, if it considers it appropriate. In any case, the UdG Library doesn’t take part in this process because it is not authorized to provide restricted articles.
​
Share
​
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 ​
​Tots els drets reservats
Show full item record