There Are No CNF Problems
SAT technology has improved rapidly in recent years, to the point now where it can solve CNF problems of immense size. But solving CNF problems ignores one important fact: there are NO problems that are originally CNF. All the CNF that SAT solvers tackle is the result of modelling some real world problem, and mapping the high-level constraints and decisions modelling the problem into clauses on binary variables. But by throwing away the high level view of the problem SAT solving may have lost a lot of important insight into how the problem is best solved. In this talk I will hope to persuade you that by keeping the original high level model of the problem one can realise immense benefits in solving hard real world problems.
Unable to display preview. Download preview PDF.
- 1.Hentenryck, P.V.: Constraint Satisfaction in Logic Programming. MIT Press (1989)Google Scholar
- 2.Marriott, K., Stuckey, P.: Programming with Constraints: an Introduction. MIT Press (1998)Google Scholar
- 7.Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Solving RCPSP/max by lazy clause generation. Journal of Scheduling (2012) (online first: August 2012), http://dx.doi.org/10.1007/s10951-012-0285-x
- 12.Schulte, C., Lagerkvist, M., Tack, G.: Gecode, http://www.gecode.org/
- 13.Perron, L.: OR-tools: Operations research tools developed at Google, https://code.google.com/p/or-tools/
- 14.SCIP: Solving constraint integer programs, http://scip.zib.de/scip.shtml