Local Search Based on Conflict Analysis for the Satisfiability Problem

Abstract

In this paper, we propose a local search method that integrates conflict analysis, usually used as part of complete search, to solve the satisfiability problem (SAT). This integration provides to the local search the following improvements: use of unit propagation, consideration of the dependencies between variables, clause learning and finally the ability to prove the unsatisfiability 1 .