Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 2015: Algorithms and Data Structures pp 178–188Cite as

Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9214))

Abstract

We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for MaxSAT. As a result, we present a parameterized algorithm of time \(O^*(1.3248^k)\) for MaxSAT, improving the previous best upper bound \(O^*(1.358^k)\) by Bliznets and Golovnev.

Supported by the National Natural Science Foundation of China under Grants (61173051, 61232001, 61472449, 61420106009, 71221061).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229, 3–27 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Asano, T., Williamson, D.: Improved approximation algorithms for MAX-SAT. Journal of Algorithms 42, 173–202 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bansal, N., Raman, V.: Upper bounds for MaxSat: further improved. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 247–258. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)

    Google Scholar 

  5. Bliznets, I., Golovnev, A.: A new algorithm for parameterized MAX-SAT. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 37–48. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Chen, J., Kanj, I.: Improved exact algorithms for Max-SAT. Discrete Applied Mathematics 142, 17–27 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67, 789–807 (2003)

    Article  MathSciNet  Google Scholar 

  9. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  10. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)

    MATH  Google Scholar 

  11. Gu, J., Purdom, P., Wah, W.: Algorithms for the satisfiability (SAT) problem: a survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, pp. 19–152 (1997)

    Google Scholar 

  12. Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard problems. PWS Publishing Company, Boston (1997)

    Google Scholar 

  13. Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. Journal of Computer and System Sciences 62, 367–375 (2001)

    Article  MathSciNet  Google Scholar 

  14. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335–354 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36(1), 63–88 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schöning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 36–43. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. The Ninth Evaluation of Max-SAT Solvers, Vienna, Austria, July 14–17, 2014

    Google Scholar 

  18. van Rooij, J., Bodlaender, H.: Exact algorithms for dominating set. Discrete Applied Mathematics 159(17), 2147–2164 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yannakakis, M.: On the approximation of maximum satisfiability. Journal of Algorithms 17, 475–502 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, People’s Republic of China

    Jianer Chen, Chao Xu & Jianxin Wang

  2. Department of Computer Science and Engineering, Texas A&M University, College Station, USA

    Jianer Chen

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianxin Wang .

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Carleton University, Ottawa, Canada

    Jörg-Rüdiger Sack

  3. University of Victoria, Victoria, Canada

    Ulrike Stege

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, J., Xu, C., Wang, J. (2015). Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm. In: Dehne, F., Sack, JR., Stege, U. (eds) Algorithms and Data Structures. WADS 2015. Lecture Notes in Computer Science(), vol 9214. Springer, Cham. https://doi.org/10.1007/978-3-319-21840-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21840-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21839-7

  • Online ISBN: 978-3-319-21840-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation