Stochastic local search for incremental SAT
Malek Mouhoub · International Journal of Knowledge-based and Intelligent Engineering Systems · 2005
The boolean satisfiability problem (SAT) is stated as follows: given a boolean formula in CNF, find a truth assignment that satisfies its clauses. In this paper, we present a general framework based on stochastic local search and the structure of the