Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems

In this paper we study the solution of SAT problems formulated as discrete decision and discrete constrained optimization problems. Constrained formulations are better than traditional unconstrained formulations because violated constraints may provide additional forces to lead a search towards a satisfiable assignment. We summarize the theory of extended saddle points in penalty formulations for solving discrete constrained optimization problems and the associated discrete penalty method (DPM). We then examine various formulations of the objective function, choices of neighborhood in DPM, strategies for updating penalties, and heuristics for avoiding traps. Experimental evaluations on hard benchmark instances pinpoint that traps contribute significantly to the inefficiency of DPM and force a trajectory to repeatedly visit the same set of or nearby points in the original variable space. To address this issue, we propose and study two trap-avoidance strategies. The first strategy adds extra penalties on unsatisfied clauses inside a trap, leading to very large penalties for unsatisfied clauses that are trapped more often and making these clauses more likely to be satisfied in the future. The second strategy stores information on points visited before, whether inside traps or not, and avoids visiting points that are close to points visited before. It can be implemented by modifying the penalty function in such a way that, if a trajectory gets close to points visited before, an extra penalty will take effect and force the trajectory to a new region. It specializes to the first strategy because traps are special cases of points visited before. Finally, we show experimental results on evaluating benchmarks in the DIMACS and SATLIB archives and compare our results with existing results on GSAT, WalkSAT, LSDL, and Grasp. The results demonstrate that DPM with trap avoidance is robust as well as effective for solving hard SAT problems.

[1]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[2]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[3]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[4]  P. Barth.  A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .

[5]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[6]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[7]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[8]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[9]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.

[10]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[11]  Alex S. Fukunaga.  Efficient Implementations of SAT Local Search , 2004, SAT.

[12]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[13]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[14]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[15]  Tao Wang,et al.  Constrained simulated annealing with applications in nonlinear continuous constrained global optimization , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[16]  Jun Gu,et al.  A Novel Discrete Relaxation Architecture , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Zhe Wu,et al.  Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems , 1999, AAAI/IAAI.

[18]  Benjamin W. Wah,et al.  Lagrangian techniques for solving a class of zero-one integer linear programs , 1995, Proceedings Nineteenth Annual International Computer Software and Applications Conference (COMPSAC'95).

[19]  Giandomenico Spezzano,et al.  Combining cellular genetic algorithms and local search for solving satisfiability problems , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[20]  Jun Gu,et al.  Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[21]  Daniele Pretolani,et al.  Efficiency and stability of hypergraph SAT algorithms , 1993, Cliques, Coloring, and Satisfiability.

[22]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[23]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[24]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[25]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[26]  Benjamin W. Wah,et al.  Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems , 1997, J. Glob. Optim..

[27]  Jeremy Frank.  Learning Short-Term Weights for GSAT , 1997, IJCAI.

[28]  Benjamin W. Wah,et al.  A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..

[29]  S. Malik,et al.  Towards symmetric treatment of con?icts and satisfaction in quanti-fied Boolean satisfiability solv , 2002 .

[30]  Pascal Van Hentenryck,et al.  Control Abstractions for Local Search , 2003, Constraints.

[31]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[32]  Tao Wang,et al.  Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization , 1999, CP.

[33]  Zhe Wu,et al.  The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization , 1999, CP.

[34]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[35]  Jun Gu,et al.  Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..

[36]  Peter J. Stuckey,et al.  A Lagrangian reconstruction of a class of local search methods , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[37]  Toby Walsh,et al.  Morphing: Combining Structure and Randomness , 1999, AAAI/IAAI.

[38]  Jun Gu,et al.  Global Optimization for Satisfiability (SAT) Problem , 1994, IEEE Trans. Knowl. Data Eng..

[39]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[40]  Jacques Carlier,et al.  SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.

[41]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[42]  Benjamin W. Wah,et al.  Global Optimization for Neural Network Training , 1996, Computer.

[43]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[44]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[45]  Peter Spellucci,et al.  An SQP method for general nonlinear programs using only equality constrained subproblems , 1998, Math. Program..

[46]  Sharad Malik,et al.  Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation , 2002, CP.