Cooperative Approach for the Satisfiability Problem
Résumé
We present a cooperation model between complete and incomplete algorithms to solve SAT problem. The involved algorithms are an exhaustive search; Satz and a local search; Walksat and its variants. An important feature of this hybridization is the exploitation, during the local search, of the variable dependencies (implications and equivalencies).