A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational Biology
[chapter]
2010
Hybrid Optimization
Boolean constraints play a fundamental rôle in optimization and constraint satisfaction. The resolution of these constraints has been the subject of intense and successful work during the past decade, and SAT solvers have reached a spectacular maturity. This chapter gives a brief overview of the relevant literature on modern SAT solvers and on the recent efforts to better integrate Boolean reasoning with other constraint satisfaction techniques. As a case study that illustrates the use of SAT
doi:10.1007/978-1-4419-1644-0_13
fatcat:qrvwyo7wmvapxetsppwqldbxoe