keep up to date with research on the satisfiability problem
The main change in 1.6.2 is the addition of the SAT backend. The first iteration of this feature was written by Patrick Spracklen as a summer student project. All constraints in the language have a SAT encoding. MiniSat and Lingeling are fully supported as backend solvers: 1.6.2 can run them, parse the solution and collect some statistics from the solver.