{"type":"ScholarlyArticle","title":"A Fast Algorithm for MaxSAT above Half Number of Clauses","authors":[{"name":"Junqiang Peng","slug":"junqiang-peng","given":"Junqiang","family":"Peng","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"},{"name":"Mingyu Xiao","slug":"mingyu-xiao","given":"Mingyu","family":"Xiao","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"}],"abstract":"We study the following parameterization of the MaxSAT problem: Given a CNF formula F with m clauses, decide whether at least m/2 + μ clauses in F could be satisfied,\r\nwhere μ is the excess of the number of satisfied clauses over the trivial lower bound m/2 and is taken as the parameter. This perspective is known as the \"above guarantee\" parameterization. Since its introduction by Mahajan and Raman [1999], the analysis of parameterization above guarantee has become a highly active and fruitful line of research. In this paper, we develop a new algorithm with runtime O*(2.1479^μ), significantly improving the previous best upper bound O*(5.4064^μ) for this important problem. Here, the O* notation omits polynomial factors.","doi":"10.24963/ijcai.2024/214","url":"https://ijcai.org/proceedings/2024/214","pdf":"https://ijcai.org/proceedings/2024/0214.pdf","markdown":"https://ijcai.org/proceedings/2024/214.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/214","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":214,"pages":{"first":1935,"last":1943},"keywords":["Constraint Satisfaction and Optimization: CSO: Constraint satisfaction","Constraint Satisfaction and Optimization: CSO: Constraint optimization problems","Constraint Satisfaction and Optimization: CSO: Satisfiabilty","Search: S: Combinatorial search and optimisation"],"videos":[],"references":[{"position":1,"raw":"[Al-Yahya et al., 2023] Tasniem Nasser Al-Yahya, Mo- hamed El Bachir Menai, and Hassan Mathkour. On the structure of the boolean satisfiability problem: A survey. ACM Comput. Surv., 55(3):46:1-46:34, 2023.","title":"Tasniem Nasser Al-Yahya, Mohamed El Bachir Menai, and Hassan Mathkour. On the structure of the boolean satisfiability problem: A survey","authors":"Al-Yahya","year":"2023","venue":"ACM Comput. Surv","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bansal and Raman, 1999] Nikhil Bansal and Venkatesh Ra- man. Upper bounds for maxsat: Further improved. In ISAAC 1999, pages 247-258, 1999.","title":"Upper bounds for maxsat: Further improved","authors":"Nikhil Bansal, Venkatesh Raman","year":"1999","venue":"ISAAC 1999","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Biere et al., 2021] Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satisfiabil- ity -Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2021.","title":"Handbook of Satisfiability -Second Edition","authors":"Biere","year":"2021","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bliznets and Golovnev, 2012] Ivan Bliznets and Alexander Golovnev. A new algorithm for parameterized max-sat. In Parameterized and Exact Computation, IPEC 2012, pages 37-48. Springer, 2012.","title":"Ivan Bliznets and Alexander Golovnev. A new algorithm for parameterized max-sat","authors":"Golovnev Bliznets","year":"2012","venue":"Parameterized and Exact Computation, IPEC 2012","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brilliantov et al., 2023] Kirill Brilliantov, Vasily Alferov, and Ivan Bliznets. Improved algorithms for maximum satisfiability and its special cases. In Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2023, volume 37, pages 3898-3905, 2023.","title":"Improved algorithms for maximum satisfiability and its special cases","authors":"Kirill Brilliantov, Vasily Alferov, Ivan Bliznets","year":"2023","venue":"Proceedings of the AAAI Conference on Artificial Intelligence, AAAI 2023","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen and Kanj, 2004] Jianer Chen and Iyad A Kanj. Im- proved exact algorithms for max-sat. Discret. Appl. Math., 142(1):17-27, 2004.","title":"Jianer Chen and Iyad A Kanj. Improved exact algorithms for max-sat","authors":"Kanj Chen","year":"2004","venue":"Discret. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chen et al., 2017] Jianer Chen, Chao Xu, and Jianxin Wang. Dealing with 4-variables by resolution: An im- proved maxsat algorithm. Theoretical Computer Science, 670:33-44, 2017.","title":"Dealing with 4-variables by resolution: An improved maxsat algorithm","authors":"Chen","year":"2017","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chu et al., 2021] Huairui Chu, Mingyu Xiao, and Zhe Zhang. An improved upper bound for SAT. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, pages 3707-3714. AAAI Press, 2021.","title":"An improved upper bound for SAT","authors":"Chu","year":"2021","venue":"Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chu et al., 2023] Yi Chu, Shaowei Cai, and Chuan Luo. Nuwls: Improving local search for (weighted) partial maxsat by new weighting techniques. In Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, pages 3915-3923. AAAI Press, 2023.","title":"Nuwls: Improving local search for (weighted) partial maxsat by new weighting techniques","authors":"Yi Chu, Shaowei Cai, Chuan Luo","year":"2023","venue":"Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cook, 1971] Stephen A. Cook. The complexity of theorem- proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC 1971, pages 151-158. ACM, 1971.","title":"The complexity of theoremproving procedures","authors":"Stephen A Cook","year":"1971","venue":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC 1971","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Crowston et al., 2012] Robert Crowston, Gregory Z. Gutin, Mark Jones, and Anders Yeo. A new lower bound on the maximum number of satisfied clauses in max-sat and its al- gorithmic applications. Algorithmica, 64(1):56-68, 2012.","title":"A new lower bound on the maximum number of satisfied clauses in max-sat and its algorithmic applications","authors":"Robert Crowston, Gregory Z Gutin, Mark Jones, Anders Yeo","year":"2012","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cygan et al., 2013] Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory, 5(1):3:1-3:11, 2013.","title":"On multiway cut parameterized above lower bounds","authors":"Cygan","year":"2013","venue":"ACM Trans. Comput. Theory","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dantsin and Hirsch, 2021] Evgeny Dantsin and Edward A. Hirsch. Worst-case upper bounds. In Handbook of Satisfi- ability -Second Edition, pages 669-692. IOS Press, 2021.","title":"Handbook of Satisfiability -Second Edition","authors":"Hirsch ; Dantsin, Evgeny Dantsin, Edward A Hirsch","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fichte et al., 2023] Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, and Stefan Szeider. The silent (r)evolution of SAT. Commun. ACM, 66(6):64-72, 2023.","title":"The silent (r)evolution of SAT","authors":"Fichte","year":"2023","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fomin and Kratsch, 2010] Fedor V. Fomin and Dieter Kratsch. Exact Exponential Algorithms. Springer, 2010.","title":"Exact Exponential Algorithms","authors":"V Fedor, Dieter Fomin, Kratsch","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Garey and Johnson, 1979] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"Michael R Garey, David S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Garg and Philip, 2016] Shivam Garg and Geevarghese Philip. Raising the bar for vertex cover: Fixed-parameter tractability above A higher guarantee. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pages 1152-1166.","title":"Raising the bar for vertex cover: Fixed-parameter tractability above A higher guarantee","authors":"Shivam Garg, Geevarghese Philip","year":null,"venue":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gutin and Mnich, 2022] Gregory Z. Gutin and Matthias Mnich. A survey on graph problems parameterized above and below guaranteed values. CoRR, abs/2207.12278, 2022.","title":"A survey on graph problems parameterized above and below guaranteed values","authors":"Gregory Z Gutin, Matthias Mnich","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gutin and Yeo, 2017] Gregory Z. Gutin and Anders Yeo. Parameterized constraint satisfaction problems: a sur- vey. In The Constraint Satisfaction Problem: Complexity and Approximability, volume 7, pages 179-203. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2017.","title":"Parameterized constraint satisfaction problems: a survey","authors":"Gregory Z Gutin, Anders Yeo","year":"2017","venue":"The Constraint Satisfaction Problem: Complexity and Approximability","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gutin et al., 2013] Gregory Z. Gutin, Mark Jones, Dominik Scheder, and Anders Yeo. A new bound for 3-satisfiable maxsat and its algorithmic application. Inf. Comput., 231:117-124, 2013.","title":"A new bound for 3-satisfiable maxsat and its algorithmic application","authors":"Gregory Z Gutin, Mark Jones, Dominik Scheder, Anders Yeo","year":"2013","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Impagliazzo and Paturi, 2001] Russell Impagliazzo and Ra- mamohan Paturi. On the complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367-375, 2001.","title":"Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-SAT","authors":"Paturi Impagliazzo","year":"2001","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kim and Williams, 2011] Eun Jung Kim and Ryan Williams. Improved parameterized algorithms for above average constraint satisfaction. In Parameterized and Exact Computation -6th International Symposium, IPEC 2011, volume 7112, pages 118-131. Springer, 2011.","title":"Improved parameterized algorithms for above average constraint satisfaction","authors":"Eun Jung, Kim, Ryan Williams","year":"2011","venue":"Parameterized and Exact Computation -6th International Symposium, IPEC 2011","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Li et al., 2023] Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, and Felip Manyà. A new variable or- dering for in-processing bounded variable elimination in SAT solvers. In Proceedings of the Thirty-Second Inter- national Joint Conference on Artificial Intelligence, IJCAI 2023, pages 1979-1987. ijcai.org, 2023.","title":"A new variable ordering for in-processing bounded variable elimination in SAT solvers","authors":"Li","year":"2023","venue":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023","doi":null,"url":null,"internal_url":"/proceedings/2023/220"},{"position":24,"raw":"[Lokshtanov et al., 2014] Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanu- jan, and Saket Saurabh. Faster parameterized algorithms using linear programming. ACM Trans. Algorithms, 11(2):15:1-15:31, 2014.","title":"Faster parameterized algorithms using linear programming","authors":"N S Daniel Lokshtanov, Narayanaswamy, M S Venkatesh Raman, Saket Ramanujan, Saurabh","year":"2014","venue":"ACM Trans. Algorithms","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Mahajan and Raman, 1999] Meena Mahajan and Venkatesh Raman. Parameterizing above guaranteed values: Maxsat and maxcut. Journal of Algorithms, 31(2):335-354, 1999.","title":"Parameterizing above guaranteed values: Maxsat and maxcut","authors":"Raman Mahajan, Meena Mahajan, Venkatesh Raman","year":"1999","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Mahajan et al., 2009] Meena Mahajan, Venkatesh Raman, and Somnath Sikdar. Parameterizing above or below guar- anteed values. J. Comput. Syst. Sci., 75(2):137-153, 2009.","title":"Parameterizing above or below guaranteed values","authors":"Meena Mahajan, Venkatesh Raman, Somnath Sikdar","year":"2009","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Peng and Xiao, 2023] Junqiang Peng and Mingyu Xiao. Fast algorithms for SAT with bounded occurrences of vari- ables. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, pages 2004-2012. ijcai.org, 2023.","title":"Fast algorithms for SAT with bounded occurrences of variables","authors":"Xiao ; Peng, Junqiang Peng, Mingyu Xiao","year":"2023","venue":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023","doi":null,"url":null,"internal_url":"/proceedings/2023/223"},{"position":28,"raw":"[Samer and Szeider, 2021] Marko Samer and Stefan Szeider. Fixed-parameter tractability. In Handbook of Satisfiability -Second Edition, pages 693-736. IOS Press, 2021.","title":"Fixed-parameter tractability","authors":"Marko Samer, Stefan Szeider","year":"2021","venue":"Handbook of Satisfiability -Second Edition","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Schaefer, 1978] Thomas J. Schaefer. The complexity of sat- isfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA, pages 216-226. ACM, 1978.","title":"The complexity of satisfiability problems","authors":"J Thomas, Schaefer","year":"1978","venue":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[van Rooij and Bodlaender, 2011] Johan M. M. van Rooij and Hans L. Bodlaender. Exact algorithms for dominat- ing set. Discret. Appl. Math., 159(17):2147-2164, 2011.","title":"Exact algorithms for dominating set","authors":"M M Johan, Hans L Van Rooij, Bodlaender","year":"2011","venue":"Discret. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Xiao, 2022] Mingyu Xiao. An exact maxsat algorithm: Fur- ther observations and further improvements. In Proceed- ings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, pages 1887-1893. ij- cai.org, 2022.","title":"An exact maxsat algorithm: Further observations and further improvements","authors":"Mingyu Xiao","year":"2022","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022","doi":null,"url":null,"internal_url":"/proceedings/2022/262"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}