Managing learnt clauses among a parallel, memory shared, SAT solver is a crucial but difficult task. Based on some statistical experiments made on learnt clauses, we propose a simple parallel version of Glucose that uses a lazy policy to exchange clauses between cores. This policy does not send a clause when it is learnt, but later, when it has a chance to be useful locally. We also propose a strategy for clauses importation that put them in "probation" before a potential entry in the search, thus limiting the negative impact of high importation rates, both in terms of noise and decreasing propagation speed. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Audemard, G., & Simon, L. (2014). Lazy clause exchange policy for parallel SAT solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8561 LNCS, pp. 197–205). Springer Verlag. https://doi.org/10.1007/978-3-319-09284-3_15
Mendeley helps you to discover research relevant for your work.