| Título | On the Modularity of Industrial SAT Instances |
| Publication Type | Conference Paper |
| Year of Publication | 2011 |
| Authors | Ansótegui C, Levy J |
| Editor | Fernandez C, Geffner H, Manyà F |
| Conference Name | Proc. of the 14th Int. Conf. of the ACIA, CCIA'11 |
| Volume | 232 |
| Editorial | IOS Press |
| Conference Location | Lleida, Spain |
| Paginación | 11-20 |
| Date Published | 26/10/2011 |
| Palabras clave | SAT |
| Resumen | Learning, re-starting and other techniques of modern SAT solvers have been shown efficient when solving SAT instances from industrial application. The ability to exploit the structure of these instances has been proposed as the responsible of such success. Here we study the modularity of some of these instances, used in the latest SAT competitions. Using a simple label propagation algorithm we show that the community structure of most of these SAT instances can be identified very efficiently. We also discuss how this structure may be used to speed up SAT solvers. |
