Building structure into local search for SAT

  • Authors:

  • Duc Nghia Pham;John Thornton;Abdul Sattar

  • Affiliations:

  • National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University, Australia;National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University, Australia;National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University, Australia

  • Venue:
  • IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recentwork 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. In this paper we show that local search techniques can effectively exploit information about problem structure producing significant improvements in performance on structured problem instances. Building on the earlier work of Ostrowski et al. we describe how information about variable dependencies can be built into a local search, so that only independent variables are considered for flipping. The cost effect of a flip is then dynamically calculated using a dependency lattice that models dependent variables using gates (specifically and, or and equivalence gates). The experimental study on hard structured benchmark problems demonstrates that our new approach significantly outperforms the previously reported best local search techniques.