Skip to main content

Advertisement

Springer Nature Link
Log in

Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach

  • Published:
Journal of Mathematical Modelling and Algorithms in Operations Research

Abstract

In this paper, we study SAT and MAX-SAT using the integer linear programming models and L-partition approach. This approach can be applied to analyze and solve many discrete optimization problems including location, covering, scheduling problems. We describe examples of SAT and MAX-SAT families for which the cardinality of L-covering of the relaxation polytope grows exponentially with the number of variables. These properties are useful in analysis and development of algorithms based on the linear relaxation of the problems. Besides we present the L-class enumeration algorithm for SAT using the L-partition approach. In addition we consider an application of this algorithm to construct exact algorithm and local search algorithms for the MAX-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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Adelshin, A.V.: Maximum satisfiability problem and some algorithms of integer programming. In: Eremin, I.I., Machnev, A.A. (eds.) Proc. of International Workshop “Algebra and Linear Optimization”, pp. 235–239. Ekaterinburg (in Russian) (2002)

  2. Adelshin, A.V.: Investigation of maximum and minimum satisfiability problems using L-partition. Autom. Remote Control 65(3), 388–395 (2004)

    Article  MathSciNet  Google Scholar 

  3. Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Comb. Optim. 2(4), 299–306 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cheriyan, J., Cunningham, W.H., et al.: A Linear programming and rounding approach to max 2-sat. DIMACS Ser. Discret. Math. Theor. Comput. Sci. 26, 395–414 (1996)

    MathSciNet  Google Scholar 

  5. Cook, S.A.: The complexity of theorem-proving procedure. In: Proc. 3rd Annual ACM Symposium on the Theory of Computing, pp. 151–159 (1971)

  6. Cruz-Chavez, M., Rivera-Lopez, R.: A local search algorithm for a SAT representation of scheduling problems. Lect. Notes Comput. Sci. 4707(3), 697–709 (2007)

    Article  Google Scholar 

  7. Dantsin, E., Hirsch, E.A., Ivanov, S., Vsemirnov, M.: Algorithms for SAT and upper bounds on their complexity. Electron. Colloq. Comput. Complex. 12, 1–19 (2001)

    Google Scholar 

  8. Eremeev, A.V., Kolokolov, A.A., Zaozerskaya, L.A.: A hybrid algorithm for the set covering problem. In: Proc. of International Workshop “Discrete Optimization Methods in Design”, pp. 123–129. Minsk (2000)

  9. Gu, J., Purdom, P.W., et al.: Algorithms for the satisfiability (SAT) problem: a survey. DIMACS Ser. Discret. Math. Theor. Comput. Sci. 35, 19–151 (1997)

    MathSciNet  Google Scholar 

  10. Guseletova, O.N., Kolokolov, A.A.: Discrete optimization with logical constraints for design of complex products. Autom. Remote Control 69, 1808–1813 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 4, 279–303 (1990)

    Article  MathSciNet  Google Scholar 

  12. Kallrath, J.: Gemischt-Ganzzahlige Optimierung: Modellierung in der Praxis. Vieweg, Wiesbaden (2002)

  13. Kolokolov, A.A.: Regular partitions and cuts in the integer programming. In: Discrete Analysis and Operations Research, pp. 59–79. Kluver Academic, Netherlands (1996)

  14. Kolokolov, A.A., Cheredova, J.N.: Research and solving the SAT problem using L-partition. In: Proc. International Conference “Discrete Analysis and Operations Research”, p. 150 (in Russian) (2000)

  15. Kolokolov, A.A., Yarosh, A.V.: Computer-aided design of complex products using discrete optimization and information technologies. Omsk Sci. Bull. 2(90), 234–238 (in Russian) (2010)

    Google Scholar 

  16. Kolokolov, A.A., Adelshin, A.V., Cheredova, J.N.: Application of L-partition to investigation of some satisfiability problems. In: Proc. 12th Baikal International Conference “Optimization Methods and Their Applications”, pp. 166–172 (in Russian) (2001)

  17. Kolokolov, A., Kallrath, J., Yagofarova, D.: Analysis and solving the satisfiability problem using L-partition. In: Proc. Annual International Conference of the GOR, p. 128. Heidelberg (2003)

  18. Kolokolov, A.A., Adelshin, A.V., Yagofarova, D.I.: Local search algorithms for the MAX SAT problem based on L-class enumeration. In: 18th Mini Euro Conference on VNS: Extended Abstracts, pp. 117–118. Tenerife (2005)

  19. Kolokolov, A.A., Yagofarova, D.I, Tyuryumov, A.N.: Using L-class enumeration method in local search algorithms for the maximum satisfiability problem. Omsk Sci. Bull. 5(39), 57–61 (in Russian) (2006)

    Google Scholar 

  20. Kolokolov, A.A., Adelshin, A.V., Yagofarova, D.I.: Solving the satisfiability problem using an L-class enumeration method. Inf. Technol. 2, 54–59 (in Russian) (2009)

    Google Scholar 

  21. Yagofarova, D.I.: Analysis of L-structure of 2-SAT problem. In: Proc. Annual Scientific Conference “Under Symbol Σ”, pp. 71–77. Omsk, Russia (in Russian) (2003)

  22. Yang, Q., Wu, K., Jiang, Y.: Learning action models from plan examples using weighted MAX-SAT. Artif. Intell. 171, 107–143 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Yarosh, A., Kolokolov, A.: On solving some complex design problems using discrete optimization models. In: Proc. Annual International Conference of the GOR, p. 136. Heidelberg (2003)

Download references

Author information

Authors and Affiliations

  1. Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, 13, Pevtsov St., 644099, Omsk, Russia

    Alexander Kolokolov & Alexander Adelshin

  2. Omsk F.M. Dostoevsky State University, 55a, Mira pr., 644077, Omsk, Russia

    Darya Yagofarova

Authors
  1. Alexander Kolokolov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Adelshin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Darya Yagofarova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Adelshin.

Additional information

This research was funded by Russian Foundation for Basic Research project 10-01-00598.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolokolov, A., Adelshin, A. & Yagofarova, D. Analysis and Solving SAT and MAX-SAT Problems Using an L-partition Approach. J Math Model Algor 12, 201–212 (2013). https://doi.org/10.1007/s10852-012-9202-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-012-9202-8

Keywords