{"type":"ScholarlyArticle","title":"An Exact MaxSAT Algorithm: Further Observations and Further Improvements","authors":[{"name":"Mingyu Xiao","slug":"mingyu-xiao","given":"Mingyu","family":"Xiao","affiliation":"University of Electronic Science and Technology of China , Chengdu , China"}],"abstract":"In the maximum satisfiability problem (MaxSAT), given a CNF formula with m clauses and n variables, we are asked to find an assignment of the variables to satisfy the maximum number of clauses. Chen and Kanj showed that this problem can be solved in O*(1.3248^m) time (DAM 2004) and the running time bound was improved to O*(1.2989^m) by Xu et al. (IJCAI 2019). In this paper, we further improve the result to O*(1.2886^m). By using some new reduction and branching techniques we can avoid several bottlenecks in previous algorithms and get the improvement on this important problem.","doi":"10.24963/ijcai.2022/262","url":"https://ijcai.org/proceedings/2022/262","pdf":"https://ijcai.org/proceedings/2022/0262.pdf","markdown":"https://ijcai.org/proceedings/2022/262.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/262","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":262,"pages":{"first":1887,"last":1893},"keywords":["Constraint Satisfaction and Optimization: Satisfiabilty"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986544","length_sec":70,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984687","length_sec":360,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Alferov and Bliznets, 2021] Vasily Alferov and Ivan Bliznets. New length dependent algorithm for maximum satisfiability problem. In AAAI 2021, Virtual Event, February 2-9, 2021, pages 3634-3641, 2021.","title":"New length dependent algorithm for maximum satisfiability problem","authors":"Bliznets Alferov, Vasily Alferov, Ivan Bliznets","year":"2021","venue":"AAAI 2021, Virtual Event","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bacchus et al., 2021] Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. Maximum satisfiability. In Handbook of Satisfiability (Second Edition), pages 929-991. IOS Press, 2021.","title":"Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. Maximum satisfiability","authors":"Bacchus","year":"2021","venue":"Handbook of Satisfiability (Second Edition)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bansal and Raman, 1999] Nikhil Bansal and Venkatesh Ra- man. Upper bounds for maxsat: Further improved. In Alok Aggarwal and C. Pandu Rangan, editors, ISAAC '99, volume 1741 of LNCS, pages 247-258. Springer, 1999.","title":"Upper bounds for maxsat: Further improved","authors":"Nikhil Bansal, Venkatesh Raman","year":"1999","venue":"ISAAC '99","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 Dimitrios M. Thilikos and Gerhard J. Woeginger, ed- itors, Parameterized and Exact Computation -7th Inter- national Symposium, IPEC 2012, volume 7535 of LNCS, 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 -7th International Symposium, IPEC 2012","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonet et al., 2007] Maria Luisa Bonet, Jordi Levy, and Fe- lip Manyà. Resolution for max-sat. Artif. Intell., 171(8- 9):606-618, 2007.","title":"Resolution for max-sat","authors":"Luisa Maria, Jordi Bonet, Levy","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cai et al., 2017] Shaowei Cai, Chuan Luo, and Haochen Zhang. From decimation to local search and back: A new approach to maxsat. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Arti- ficial Intelligence, IJCAI 2017, Melbourne, Australia, Au- gust 19-25, 2017, pages 571-577. ijcai.org, 2017.","title":"From decimation to local search and back: A new approach to maxsat","authors":"Shaowei Cai, Chuan Luo, Haochen Zhang","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/80"},{"position":7,"raw":"[Chen and Kanj, 2004] Jianer Chen and Iyad A. Kanj. Im- proved exact algorithms for MAX-SAT. Discret. Appl. Math., 142(1-3):17-27, 2004.","title":"Improved exact algorithms for MAX-SAT","authors":"Chen, Kanj ;, Jianer Chen, Iyad A Kanj","year":"2004","venue":"Discret. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen et al., 2017] Jianer Chen, Chao Xu, and Jianxin Wang. Dealing with 4-variables by resolution: An im- proved maxsat algorithm. Theor. Comput. Sci., 670:33-44, 2017.","title":"Dealing with 4-variables by resolution: An improved maxsat algorithm","authors":"Chen","year":"2017","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chu et al., 2021] Huairui Chu, Mingyu Xiao, and Zhe Zhang. An improved upper bound for SAT. In AAAI 2021, Virtual Event, February 2-9, 2021, pages 3707- 3714, 2021.","title":"An improved upper bound for SAT","authors":"Chu","year":"2021","venue":"AAAI 2021, Virtual Event","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, May 3-5, 1971, Shaker Heights, Ohio, USA, pages 151-158, 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","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fomin and Kratsch, 2010] Fedor V. Fomin and Dieter Kratsch. Exact Exponential Algorithms. Texts in The- oretical Computer Science. An EATCS Series. Springer, 2010.","title":"Exact Exponential Algorithms","authors":"V Fedor, Dieter Fomin, Kratsch","year":"2010","venue":"Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":12,"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":13,"raw":"[Hirsch, 1998] Edward A. Hirsch. Two new upper bounds for SAT. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, USA, pages 521-530, 1998.","title":"Two new upper bounds for SAT","authors":"Edward A Hirsch","year":"1998","venue":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hutter et al., 2017] Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger H. Hoos, and Kevin Leyton- Brown. The configurable SAT solver challenge (CSSC). Artif. Intell., 243:1-25, 2017.","title":"The configurable SAT solver challenge (CSSC)","authors":"Hutter","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"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":16,"raw":"[Li and Manyà, 2021] Chu Min Li and Felip Manyà. MaxSAT, hard and soft constraints. In Handbook of Sat- isfiability (Second Edition), pages 903-927. IOS Press, 2021.","title":"MaxSAT, hard and soft constraints","authors":"Min Chu, Felip Li, Manyà","year":"2021","venue":"Handbook of Satisfiability (Second Edition)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Li et al., 2016] Chu Min Li, Felip Manyà, and Joan Ramon Soler. A clause tableau calculus for maxsat. In Subbarao Kambhampati, editor, Proceedings of the Twenty-Fifth In- ternational Joint Conference on Artificial Intelligence, I- JCAI 2016, New York, NY, USA, 9-15 July 2016, pages 766-772, 2016.","title":"A clause tableau calculus for maxsat","authors":"Min Chu, Felip Li, Joan Ramon Manyà, Soler","year":"2016","venue":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, I-JCAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/114"},{"position":18,"raw":"[Monien et al., 1981] Burkhard Monien, Ewald Specken- meyer, and Oliver Vornberger. Upper bounds for covering problems. Methods of operations research, 43:419-431, 1981.","title":"Upper bounds for covering problems","authors":"Ewald Burkhard Monien, Oliver Speckenmeyer, Vornberger","year":"1981","venue":"Methods of operations research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Morgado et al., 2013] António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, and João Marques-Silva. Iterative and core-guided maxsat solving: A survey and assessment. Constraints An Int. J., 18(4):478-534, 2013.","title":"Iterative and core-guided maxsat solving: A survey and assessment","authors":"António Morgado, Federico Heras, Mark H Liffiton, Jordi Planes, João Marques-Silva","year":"2013","venue":"Constraints An Int. J","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Niedermeier and Rossmanith, 1999] Rolf Niedermeier and Peter Rossmanith. New upper bounds for maxsat. In Jirí Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, ICALP'99, volume 1644 of LNCS, pages 575-584. Springer, 1999.","title":"New upper bounds for maxsat","authors":"Rossmanith Niedermeier, Rolf Niedermeier, Peter Rossmanith","year":"1999","venue":"ICALP'99","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Peng and Xiao, 2021] Junqiang Peng and Mingyu Xiao. A fast algorithm for SAT in terms of formula length. In Chu- Min Li and Felip Manyà, editors, SAT 2021 -24th Inter- national Conference, volume 12831 of LNCS, pages 436- 452. Springer, 2021.","title":"A fast algorithm for SAT in terms of formula length","authors":"Xiao ; Peng, Junqiang Peng, Mingyu Xiao","year":"2021","venue":"SAT 2021 -24th International Conference","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Robinson, 1965] John Alan Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23- 41, 1965.","title":"A machine-oriented logic based on the resolution principle","authors":"John Alan, Robinson","year":"1965","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Xiao et al., 2021] Mingyu Xiao, Sen Huang, Yi Zhou, and Bolin Ding. Efficient reductions and a fast algorithm of maximum weighted independent set. In Jure Leskovec, Marko Grobelnik, Marc Najork, Jie Tang, and Leila Zia, editors, WWW '21: The Web Conference 2021, Ljubljana, Slovenia, April 19-23, 2021, pages 3930-3940, 2021.","title":"Efficient reductions and a fast algorithm of maximum weighted independent set","authors":"Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding","year":"2021","venue":"WWW '21: The Web Conference 2021","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Xu et al., 2019] Chao Xu, Wenjun Li, Yongjie Yang, Jian- er Chen, and Jianxin Wang. Resolution and domination: An improved exact maxsat algorithm. In Sarit Kraus, ed- itor, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pages 1191-1197, 2019.","title":"Resolution and domination: An improved exact maxsat algorithm","authors":"Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang","year":"2019","venue":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019","doi":null,"url":null,"internal_url":"/proceedings/2019/166"},{"position":25,"raw":"[Yamamoto, 2005] Masaki Yamamoto. An improved O(1.234 m )-time deterministic algorithm for SAT. In Xiaotie Deng and Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, volume 3827 of LNCS, pages 644-653. Springer, 2005.","title":"An improved O(1.234 m )-time deterministic algorithm for SAT","authors":"Masaki Yamamoto","year":"2005","venue":"Algorithms and Computation, 16th International Symposium, ISAAC 2005","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}