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
Text Complet
SolvingConstraintSatisfaction.pdf embargoed access ​
Sol·licita còpia
Sol·licita còpia a l'autor de l'article
En omplir aquest formulari esteu demanant una còpia de l'article dipositat al repositori institucional (DUGiDocs) al seu autor o a l'autor principal de l'article. Serà el mateix autor qui decideixi lliurar una còpia del document a qui ho sol•liciti si ho creu convenient. En tot cas, la Biblioteca de la UdG no intervé en aquest procés ja que no està autoritzada a facilitar articles quan aquests són d'accés restringit.
​
Compartir
​
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
Mostra el registre complet de l'element