Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for many real-world problems, complete search methods have the advantage, because modern heuristics are able to effectively exploit problem structure. Indeed, to develop a local search technique that can effectively deal with variable dependencies has been an open challenge since 1997.

Authors

• Duc Nghia Pham John Thornton
• John Thornton
• Abdul Sattar

Keywords

No keywords are indexed for this paper.