Skip to main content
SpringerLink
Log in

Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT problem. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real-life problems, such as the traveling salesman problem, BT"s workforce scheduling problem, the radio link frequency assignment problem, and the vehicle routing problem. We present empirical results of applying GLS to instances of the SAT problem from the DIMACS archive and also a small set of weighted MAX-SAT problem instances and compare them with the results of other local search algorithms for the SAT problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Borchers, B., Mitchell, J. E., and Joy, S.: A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT, in Satisfiability Problem: Theory and Applications, DIMACS Ser. in Discrete Math. and Theoret. Comput. Sci. 35, Amer. Math. Soc., 1997, pp. 519–536.

  2. Cha, B. and Iwama, K.: Performance test of local search algorithms using new types of random CNF formulas, in Proceedings of IJCAI'95, Morgan Kaufmann, 1995, pp. 304–310.

  3. Cha, B. and Iwama, K.: Adding new clauses for faster local search, in Proceedings of AAAI'96, MIT Press, 1996, pp. 332–337.

  4. Davenport, A.: Extensions and evaluation of GENET in constraint satisfaction, Ph.D. Thesis, Department of Computer Science, University of Essex, 1997.

  5. Davenport, A., Tsang, E. P. K., Zhu, K., andWang, C. J.: GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement, in Proceedings AAAI, 1994, pp. 325–330.

  6. Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM 7 (1960), 201–215.

    Google Scholar 

  7. Frank, J., Cheeseman, P., and Stutz, J.: When gravity fails: Local search topology, J. Artif. Intell. Res. 7 (1997), 249–281.

    Google Scholar 

  8. Frank, J.:Weighting for Godot: Learning heuristics for GSAT, in Proceedings of AAAI'96, MIT Press, 1996, pp. 338–343.

  9. Frank, J.: Learning short-term clause weights for GSAT, in Proceedings of IJCAI'97, Morgan Kaufmann, 1997, pp. 384–389.

  10. Garey, M. R. and Johnson, D. S.: Computers and Intractibility, W. H. Freeman and Company, 1979.

  11. Gent, I. and Walsh, T.: Unsatisfied variables in local search, in J. Hallam (ed.), Hybrid Problems, Hybrid Solutions (Proceedings of AISB-95), IOS Press, Amsterdam, 1995, pp. 73–85.

    Google Scholar 

  12. Gent, I. and Walsh, T.: Towards an understanding of Hill-climbing procedures for SAT, in Proceedings of AAAI-93, 1993.

  13. Ginsberg, M. and McAllester, D.: GSAT and dynamic backtracking, in Fourth Conference on Principles of Knowledge Representation and Reasoning (KR-94), May 1994, pp. 226–237.

  14. Gu, J.: Local search for satisfiability (SAT) problem, IEEE Trans. Systems Man Cybernet. 23(4) (1993).

  15. Gu, J.: Global optimization for satisfiability (SAT) problem, IEEE Trans. Knowledge and Data Engrg. 6(3) (1994), 361–381.

    Google Scholar 

  16. Hampson, S. and Kibler, D.: Large plateaus and plateau search in Boolean satisfiability problems: When to give up searching and start again, DIMACS Series, Cliques, Coloring and SAT 26 (1993), 437–456.

    Google Scholar 

  17. Hoos, H. H. and Stutzle, T.: Evaluating Las Vegas algorithms-pitfalls and remedies, in Proceedings of UAI-98, Morgan Kaufmann, 1998, pp. 238–245.

  18. Jiang, Y., Kautz, H., and Selman, B.: Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT, in 1st International Joint Workshop on Artificial Intelligence and Operations Research, 1995.

  19. Kautz, H., McAllester, D., and Selman, B.: Exploiting variable dependency in local search. Draft, Abstract in Abstracts of the Poster Sessions of IJCAI-97, Nagoya, Japan, 1997.

  20. Kilby, P., Prosser, P., and Shaw, P.: Guided local search for the vehicle routing problem, in Proceedings of the 2nd International Conference on Metaheuristics, July 1997.

  21. Lau, T. L.: Guided Genetic Algorithm, Ph.D. Thesis, Department of Computer Science, University of Essex, 1999.

  22. Lau, T. L. and Tsang, E. P. K.: Solving the generalized assignment problem with the guided genetic algorithm, in Proceedings of 10th IEEE International Conference on Tools for Artificial Intelligence, 1998.

  23. Lau, T. L. and Tsang, E. P. K.: Guided Genetic Algorithm and its application to the large processor configuration problem, in Proceedings of 10th IEEE International Conference on Tools for Artificial Intelligence, 1998.

  24. Li, C. M. and Ambulagon: Look-ahead versus look-back for satisfiability problems, in Proceedings of CP'97, Springer-Verlag, 1997, pp. 341–355.

  25. McAllester, D., Selman, B., and Kautz, H.: Evidence for invariants in local search, in Proceedings AAAI-97, Providence, RI, 1997.

  26. Minton, S., Johnson, M. D., Philips, A. B., and Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell. 58 (1992), 161–205.

    Google Scholar 

  27. Morris, P.: The breakout method for escaping from local minima, in Proceedings of AAAI-93, AAAI Press/MIT Press, 1993, pp. 40–45.

  28. Resende, M. G. C. and Feo, T. A.: A GRASP for satisfiability, in D. S. Johnson and M. A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Ser. Discrete Math. and Theoret. Comput. Sci. 26, Amer. Math. Soc., 1996, pp. 499–520.

  29. Resende, M. G. C., Pitsoulis, L. S. and Pardalos, P. M.: Approximate solution of weighted MAX-SAT problems using GRASP, DIMACS Ser. Discrete Math. and Theoret. Comput. Sci. 35 (1997), 393–405.

    Google Scholar 

  30. Richards, T. and Richards, B.: Non-systematic search and learning: An empirical study, in M. Maher and J.-F. Puget (eds.), Proceedings of 4th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Comput. Sci. 1520, Springer-Verlag, 1998, pp. 370–384.

  31. Selman, B. and Kautz, H.: An empirical study of greedy local search for satisfiability testing, in Proceedings AAAI-93, 1993.

  32. Selman, B. and Kautz, H.: Domain-independent extensions to GSAT: Solving large structured satisfiability problems, in Proceedings IJCAI-93, 1993.

  33. Selman, B., Kautz, H., and Cohen, B.: Noise strategies for improving local search, in Proceedings AAAI-94, 1994.

  34. Selman, B., Kautz H., and McAllester, D.: Ten challenges in propositional reasoning and search, in Proceedings of the Fifteenth International Conference on Artificial Intelligence (IJCAI-97), Nagoya, Aichi, Japan, 1997.

  35. Selman, B., Levesque, H., and Mitchell, D.: A new method for solving hard satisfiability problems, in Proceedings AAAI-92, 1992.

  36. Shang, Y.: Global search methods for solving nonlinear optimization problems, Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1997.

    Google Scholar 

  37. Shang, Y. and Wah, B. W.: Improving the performance of discrete Lagrange-multiplier search for solving hard SAT problems, in Proceedings 10th International Conference on Tools with Artificial Intelligence, IEEE, 1998, to appear.

  38. Shang, Y. and Wah, B. W.: A discrete Lagrangian-based global-search method for solving satisfiability problems, J. Global Optim. 12(1) (1998), 61–99.

    Google Scholar 

  39. Tsang, E.: Foundations of Constraint Satisfaction, Academic Press, 1993.

  40. Tsang, E. and Voudouris, C.: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, Oper. Res. Lett. 20 (1997), 119–127.

    Google Scholar 

  41. Voudouris, C.: Guided local search for combinatorial optimisation problems, Ph.D. Thesis, Department of Computer Science, University of Essex, 1997.

  42. Voudouris, C.: Guided local search-an illustrative example in function optimisation, BT Technology J. 16(3) (1998), 46–50.

    Google Scholar 

  43. Voudouris, C. and Tsang, E. P. K.: Guided local search and its application to the traveling salesman problem, Europ. J. Oper. Res. 113(2) (1998), 469–499.

    Google Scholar 

  44. Voudouris, C. and Tsang, E. P. K.: Solving the radio link frequency assignment problem using guided local search, in Proceedings, NATO Symposium on Radio Length Frequency Assignment, Sharing and Conservation Systems (Aerospace), Aalborg, Denmark, October 1998.

  45. Wah, B.W. and Shang, Y.: Discrete Lagrangian-based search for solving MAX-SAT problems, in 15th International Joint Conference on Artificial Intelligence, 1997, pp. 378–383.

  46. Wang, C. J. and Tsang, E. P. K.: Solving constraint satisfaction problems using neuralnetworks, in Proceedings, IEE Second International Conference on Artificial Neural Networks, 1991, pp. 295–299.

  47. Warners, J. P. and van Maaren, H.: A two-phase algorithm for solving a class of hard satisfiability problems, Report SEN-R9802 (CWI). Oper. Res. Lett. 23 (1999), 81–88.

    Google Scholar 

  48. Warners, J. P. and van Maaren, H.: Satisfiability problems with balanced polynomial representation, Report of the Faculty of Technical Mathematics and Informatics 97–47, Deft University of Technology, 1997.

  49. Wu, Z.: The discrete Lagrangian theory and its application to solve nonlinear discrete constrained optimization problems, M.Sc. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, May 1998.

    Google Scholar 

Download references

Authors
  1. Patrick Mills
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edward Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mills, P., Tsang, E. Guided Local Search for Solving SAT and Weighted MAX-SAT Problems. Journal of Automated Reasoning 24, 205–223 (2000). https://doi.org/10.1023/A:1006343127545

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006343127545

Search

Navigation