Djamal Habet

Learn More
The main purpose of the paper is to solve structured instances of the satisfiability problem. The structure of a SAT instance is represented by an hypergraph, whose ver-tices correspond to the variables and the hyper-edges to the clauses. The proposed method is based on a tree decomposition of this hyper-graph which guides the enumera-tion process of a(More)
Local search algorithms based on the Configuration Checking (CC) strategy have been shown to be efficient in solving satisfiable random k-SAT instances. The purpose of the CC strategy is to avoid the cycling problem, which corresponds to revisiting already flipped variables too soon. It is done by considering the neighborhood of the formula variables. In(More)