Bas Joosten — SMT vs. ILP Solvers for Scheduling
|Time:||Wednesday, October 12, 2011|
|Location:||Room 101, Citadel|
SMT solvers are a generalization of SAT solvers that allow a more easy formulation of combinatorial problems when compared to ILP or SAT solvers. Over the past 5 years, SMT solvers have caught up with ILP solvers. Compared to ILP, SMT provides a more natural way to encode combinatorial problems, and solvers can find solutions faster in many practical settings. We motivate our preference for SMT solvers by giving examples in scheduling.