Using Community Structure to Detect Relevant Learnt Clauses

• Published in: Lecture notes in computer science Vol. 9340; pp. 238 - 254
• Main Authors: Ansótegui, Carlos, Giráldez-Cru, Jesús, Levy, Jordi, Simon, Laurent
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Artificial intelligence; Computer science; Mathematical theory of computation
• ISBN: 3319243179; 9783319243177
• ISSN: 0302-9743; 1611-3349; 1611-3349
• DOI: 10.1007/978-3-319-24318-4_18

Nowadays, Conflict-Driven Clause Learning (CDCL) techniques are one of the key components of modern SAT solvers specialized in industrial instances. Last years, one of the focuses has been put on strategies to select which learnt clauses are removed during the search. Originally, one need for removing clauses was motivated by the finiteness of memory. Recently, it has been shown that more aggressive clause deletion policies may improve solvers performance, even when memory is sufficient. Also, the utility of learnt clauses has been related to the modular structure of industrial SAT instances. In this paper, we show that augmenting SAT instances with learnt clauses does not always make them easier for the SAT solver. In fact, it makes worse the solver performance in many cases. However, we identify a set of highly useful learnt clauses, and we show that augmenting SAT instances with this set of clauses contributes to improve the solver performance in many cases, especially in satisfiable formulas. These clauses are related to the community structure of the formula, and they can be computed in a fast preprocessing step. This would suggest that the community structure may play an important role in clause deletion policies.