SIMPLY: a Compiler from a CSP Modeling Language to the SMT-LIB ...

idea is making the DPLL(X) engine and Solver Twork in cooperation: whilethe DPLL(X) engine is in charge of enumerating (partial) propositional models,Solver Tis responsible for checking whether these models are consistent with thegiven theory T (for example, if T is the theory of Linear Integer Arithmetic andthe current boolean model contains x + 2y ≤ 0, −y − z ≤ 0 and x − 2z > 1, thenSolver Thas to detect that the current boolean assignment is T -inconsistent).Notice that Solver Tonly needs to handle conjunctions of literals from theory T .In this way, given a formula F and a theory T , we are determining whether thereis a model of T ∪ {F }.Current SMT solvers can deal with several theories and logics. For the purposesof our tool, as we explain in Section 3, there are two logics which are especiallyrelevant, namely, quantifier free Integer Linear Arithmetic (QF LIA) andits fragment Integer Difference Logic (QF IDL). QF LIA formulas are booleancombinations of inequations between linear polynomials over integer variables.QF IDL formulas are boolean combinations of inequations of the form x − y < bwhere x and y are integer variables and b is an integer constant (see [13] fordetails). Such atoms occur in the definition of feasible solutions for many problems.For instance, they can be used to express constraints on the time elapsedbetween pairs of events. Since the satisfiability of conjunctions of difference logicliterals can be reduced to the absence of negative cycles in finite weighted graphs,it can be decided in O(n 3 ) time by the Bellman-Ford algorithm. For this reason,many solvers give a special treatment to such kind of literals.3 Simply: The toolIn this section we describe the input language and features of Simply throughan example. Let us consider the n-Queens problem: given a number n of queensof the chess game, the problem is to find a position in a board of size n × n,for each queen, such that no queen threatens any other (i.e., they are not in thesame column, row or diagonal). A naive model of the n-Queens problem (forn = 8) in the Simply input language can be found in Fig. 1, with an array q ofn integer variables where q[i], for i in 1..n, denotes the row where the queenof column i is placed. The problem is solvable iff there exists an assignment forq, according to its domain, such that all the posted constraints are satisfied, i.e.,all the values of q are different (i.e., no two queens are in the same row) and thedistances between the indexes (columns) and values (rows) of any two pair ofelements of the array are distinct (i.e., no two queens are in the same diagonal).In Fig. 2 the architecture of Simply is depicted throughout the process ofcompiling and solving the 8-Queens problem. Let the input of the compiler be thequeens 8.y file of Fig. 1. In the compilation process all constants are replaced bytheir associated value, and all variables are translated into SMT integer variables.Constraining a variable to its domain results in a disjunction of equalities whenthe domain is an explicit enumeration of values, or into a conjunction of twoinequality predicates when the domain is described as a range. The translationof the constraints typically results into a conjunction of QF LIA predicates and,