Item


Solving constraint satisfaction problems with SAT modulo theories

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

© Constraints, 2012, vol. 17, núm. 3, p. 273-303

Springer Verlag

Author: Bofill Arasa, Miquel
Palahí i Sitges, Miquel
Suy Franch, Josep
Villaret i Ausellé, Mateu
Date: 2012
Abstract: 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
Format: application/pdf
ISSN: 1383-7133 (versió paper)
1572-9354 (versió electrònica)
Document access: http://hdl.handle.net/10256/12645
Language: eng
Publisher: Springer Verlag
Collection: MEC/PN 2009-2011/TIN2008-04547
Reproducció digital del document publicat a: http://dx.doi.org/10.1007/s10601-012-9123-1
Articles publicats (D-IMA)
Is part of: © Constraints, 2012, vol. 17, núm. 3, p. 273-303
Rights: Tots els drets reservats
Subject: Programació per restriccions (Informàtica)
Constraint programming (Computer science)
Algorismes computacionals
Computer algorithms
CSP (Llenguatge de programació)
CSP (Computer program language)
Title: Solving constraint satisfaction problems with SAT modulo theories
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors