Skip to Main content Skip to Navigation
Conference papers

Predicting Learnt Clauses Quality in Modern SAT Solver

Laurent Simon 1, 2 Gilles Audemard 3 
2 GEMO - Integration of data and knowledge distributed over the web
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : Beside impressive progresses made by SAT solvers over the last ten years, only few works tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong and efficient on most industrial applications. We report in this work a key observation of CDCL solvers behavior on this family of benchmarks and explain it by an unsuspected side effect of their particular Clause Learning scheme. This new paradigm allows us to solve an important, still open, question: How to designing a fast, static, accurate, and predictive measure of new learnt clauses pertinence. Our paper is followed by empirical evidences that show how our new learning scheme improves state-of-the art results by an order of magnitude on both SAT and UNSAT industrial problems.
Document type :
Conference papers
Complete list of metadata
Contributor : Laurent Simon Connect in order to contact the contributor
Submitted on : Friday, November 20, 2009 - 11:06:55 AM
Last modification on : Sunday, June 26, 2022 - 11:50:53 AM


  • HAL Id : inria-00433805, version 1



Laurent Simon, Gilles Audemard. Predicting Learnt Clauses Quality in Modern SAT Solver. Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09), Jul 2009, Pasadena, United States. ⟨inria-00433805⟩



Record views