Abstract
In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding them into SAT.
Original language | American English |
---|---|
Title of host publication | Functional and Logic Programming |
Subtitle of host publication | 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings |
Pages | 1 |
Number of pages | 1 |
ISBN (Electronic) | 9783642298226 |
DOIs | |
State | Published - May 2012 |