Sciweavers

Share
ICTAI
2009
IEEE

Learning in Local Search

10 years 1 months ago
Learning in Local Search
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) scheme to local search. First an extended implication graph for complete assignments of the set of variables is proposed. Secondly, a unit propagation based technique for building and using such implication graph is designed. Finally, we show how this new learning scheme can be integrated to the state-of-the-art local search solver WSAT. Interestingly enough, the obtained local search approach is able to prove unsatisfiability. Experimental results show very good performances on many classes of SAT instances from the last SAT competitions.
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazu
Added 24 May 2010
Updated 24 May 2010
Type Conference
Year 2009
Where ICTAI
Authors Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais
Comments (0)
books