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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229, 3–27 (2001)
Asano, T., Williamson, D.: Improved approximation algorithms for MAX-SAT. Journal of Algorithms 42, 173–202 (2002)
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)
Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)
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)
Chen, J., Kanj, I.: Improved exact algorithms for Max-SAT. Discrete Applied Mathematics 142, 17–27 (2004)
Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)
Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67, 789–807 (2003)
Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)
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)
Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard problems. PWS Publishing Company, Boston (1997)
Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. Journal of Computer and System Sciences 62, 367–375 (2001)
Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335–354 (1999)
Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36(1), 63–88 (2000)
Schöning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 36–43. Springer, Heidelberg (2005)
The Ninth Evaluation of Max-SAT Solvers, Vienna, Austria, July 14–17, 2014
van Rooij, J., Bodlaender, H.: Exact algorithms for dominating set. Discrete Applied Mathematics 159(17), 2147–2164 (2011)
Yannakakis, M.: On the approximation of maximum satisfiability. Journal of Algorithms 17, 475–502 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)