A system for solving constraint satisfaction problems with SMT

Authors:
Miquel Bofill;Josep Suy;Mateu Villaret
Affiliations:
Departament d’Informàtica i Matemàtica Aplicada, Universitat de Girona, Girona, Spain;Departament d’Informàtica i Matemàtica Aplicada, Universitat de Girona, Girona, Spain;Departament d’Informàtica i Matemàtica Aplicada, Universitat de Girona, Girona, Spain
Venue:
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Year:
2010

Citing 9
Cited 3

SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Essence: A constraint language for specifying combinatorial problems

Constraints
Universal Booleanization of Constraint Models

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Challenges in satisfiability modulo theories

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
SAT as an effective solving technology for constraint problems

ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
From propositional satisfiability to satisfiability modulo theories

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Boolean equi-propagation for optimized SAT encoding

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Cell formation in group technology using constraint programming and Boolean satisfiability

Expert Systems with Applications: An International Journal
Solving constraint satisfaction problems with SAT modulo theories

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vectors, etc, in first-order logic with equality. SMT has its roots in the field of verification. It is known that the SAT technology offers an interesting, efficient and scalable method for constraint solving, as many experimentations have shown. Although there already exist some results pointing out the adequacy of SMT techniques for constraint solving, there are no available tools to extensively explore such adequacy. In this paper we introduce a tool for translating FlatZinc (MiniZinc intermediate code) instances of constraint satisfaction problems to the standard SMT-LIB language. It can be used for deciding satisfiability as well as for optimization. The tool determines the required logic for solving each instance. The obtained results suggest that SMT can be effectively used to solve CSPs.