{"type":"ScholarlyArticle","title":"Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT","authors":[{"name":"Zhendong Lei","slug":"zhendong-lei","given":"Zhendong","family":"Lei","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences; School of Computer and Control Engineering , University of Chinese Academy of Sciences"},{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences"}],"abstract":"Partial MaxSAT (PMS) generalizes SAT and MaxSAT by introducing hard clauses and soft clauses. PMS and Weighted PMS (WPMS) have many important real world applications. Local search is one popular method for solving (W)PMS. Recent studies on specialized local search for (W)PMS have led to significant improvements. But such specialized algorithms are complicated with the concepts tailored for hard and soft clauses. In this work, we propose a dynamic local search algorithm, which exploits the structure of (W)PMS by a carefully designed clause weighting scheme. Our solver SATLike adopts a local search framework for SAT and does not need any specialized concept for (W)PMS. Experiments on PMS and WPMS benchmarks from the MaxSAT Evaluations (MSE) 2016 and 2017 show that SATLike significantly outperforms state of the art local search solvers. Also, SATLike significantly narrows the gap between the performance of local search solvers and complete solvers on industrial benchmarks, and performs better than the complete solvers on the MSE2017 benchmarks.","doi":"10.24963/ijcai.2018/187","url":"https://ijcai.org/proceedings/2018/187","pdf":"https://ijcai.org/proceedings/2018/0187.pdf","markdown":"https://ijcai.org/proceedings/2018/187.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/187","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":187,"pages":{"first":1346,"last":1352},"keywords":["Constraints and SAT: Constraint Satisfaction","Constraints and SAT: MaxSAT, MinSAT"],"videos":[],"references":[{"position":1,"raw":"[Ansótegui and Gabàs, 2017] Carlos Ansótegui and Joel Gabàs. W- PM3: an (in)complete algorithm for weighted partial maxsat. Ar- tif. Intell., 250:37-57, 2017.","title":"Carlos Ansótegui and Joel Gabàs. W-PM3: an (in)complete algorithm for weighted partial maxsat","authors":"Gabàs Ansótegui","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ansótegui et al., 2013] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms. Artif. Intell., 196:77-105, 2013.","title":"SAT-based MaxSAT algorithms","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bacchus et al., 2014] Fahiem Bacchus, Jessica Davies, Maria T- simpoukelli, and George Katsirelos. Relaxation search: A simple way of managing optional clauses. In Proceedings of AAAI-14, pages 835-841, 2014.","title":"Relaxation search: A simple way of managing optional clauses","authors":"Bacchus","year":"2014","venue":"Proceedings of AAAI-14","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cai et al., 2014] Shaowei Cai, Chuan Luo, John Thornton, and Kaile Su. Tailoring local search for partial MaxSAT. In Pro- ceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), Québec City, Québec, Canada, pages 2623-2629, 2014.","title":"Tailoring local search for partial MaxSAT","authors":"Shaowei Cai, Chuan Luo, John Thornton, Kaile Su","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cai et al., 2016] Shaowei Cai, Chuan Luo, Jinkun Lin, and Kaile Su. New local search methods for partial maxsat. Artificial Intel- ligence, 240:1-18, 2016.","title":"New local search methods for partial maxsat","authors":"Shaowei Cai, Chuan Luo, Jinkun Lin, Kaile Su","year":"2016","venue":"Artificial Intelligence","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 Proceedings of the Twenty-Sixth International Join- t Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 571-577, 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":"[Cai, 2015] Shaowei Cai. Balance between complexity and quali- ty: Local search for minimum vertex cover in massive graphs. In Proceedings of the 24th International Joint Conference on Arti- ficial Intelligence (IJCAI), Buenos Aires, Argentina, pages 747- 753, 2015.","title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","authors":"Shaowei Cai, Cai","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2015/111"},{"position":8,"raw":"[Cha et al., 1997] Byungki Cha, Kazuo Iwama, Yahiko Kam- bayashi, and Shuichi Miyazaki. Local search algorithms for partial MAXSAT. In Proceedings of the 14th National Confer- ence on Artificial Intelligence (AAAI), Providence, Rhode Island, pages 263-268, 1997.","title":"Local search algorithms for partial MAXSAT","authors":"Cha","year":"1997","venue":"Proceedings of the 14th National Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Davies and Bacchus, 2011] Jessica Davies and Fahiem Bacchus. Solving MAXSAT by solving a sequence of simpler SAT in- stances. In Proceedings of the 17th International Conference of Principles and Practice of Constraint Programming (CP), Peru- gia, Italy, pages 225-239, 2011.","title":"Solving MAXSAT by solving a sequence of simpler SAT instances","authors":"Bacchus Davies, Jessica Davies, Fahiem Bacchus","year":"2011","venue":"Proceedings of the 17th International Conference of Principles and Practice of Constraint Programming (CP)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Davies, 2013] Jessica Davies. Solving MaxSAT by decoupling op- timization and satisfaction, 2013. PhD thesis.","title":"Solving MaxSAT by decoupling optimization and satisfaction","authors":"Jessica Davies","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fu and Malik, 2006] Zhaohui Fu and Sharad Malik. On solving the partial MAX-SAT problem. In Proceedings of the 9th Inter- national Conference of Theory and Applications of Satisfiability Testing (SAT), Seattle, WA, USA, pages 252-265, 2006.","title":"On solving the partial MAX-SAT problem","authors":"Zhaohui Fu, Sharad Malik","year":"2006","venue":"Proceedings of the 9th International Conference of Theory and Applications of Satisfiability Testing (SAT)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Grégoire et al., 2014] Éric Grégoire, Jean-Marie Lagniez, and Bertrand Mazure. An experimentally efficient method for (mss, comss) partitioning. In Proceedings of AAAI-14, pages 2666- 2673, 2014.","title":"An experimentally efficient method for (mss, comss) partitioning","authors":"Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure","year":"2014","venue":"Proceedings of AAAI-14","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hoos and Stützle, 2005] Holger H. Hoos and Thomas Stützle. S- tochastic Local Search: Foundations & Applications. Elsevier / Morgan Kaufmann, 2005.","title":"Stochastic Local Search: Foundations & Applications","authors":"H Holger, Thomas Hoos, Stützle","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Luo et al., 2015] Chuan Luo, Shaowei Cai, Wei Wu, Zhong Jie, and Kaile Su. CCLS: An efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. on Computers, 64(7):1830-1843, 2015.","title":"CCLS: An efficient local search algorithm for weighted maximum satisfiability","authors":"Chuan Luo, Shaowei Cai, Wei Wu, Zhong Jie, Kaile Su","year":"2015","venue":"IEEE Trans. on Computers","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Luo et al., 2017] Chuan Luo, Shaowei Cai, Kaile Su, and Wenx- uan Huang. CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif. Intell., 243:26- 44, 2017.","title":"CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability","authors":"Chuan Luo, Shaowei Cai, Kaile Su, Wenxuan Huang","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Marques-Silva et al., 2013] João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, and Anton Belov. On com- puting minimal correction subsets. In Proceedings of IJCAI-13, 2013.","title":"On computing minimal correction subsets","authors":"Marques-Silva","year":"2013","venue":"Proceedings of IJCAI-13","doi":null,"url":null,"internal_url":"/proceedings/2013/98"},{"position":17,"raw":"[Martins et al., 2014a] Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, and Inês Lynce. Incremental cardinality constraints for maxsat. In Proceedings of the 20th International Conference of Principles and Practice of Constraint Programming (CP), Ly- on, France, pages 531-548, 2014.","title":"Incremental cardinality constraints for maxsat","authors":"Martins","year":"2014","venue":"Proceedings of the 20th International Conference of Principles and Practice of Constraint Programming (CP)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Martins et al., 2014b] Ruben Martins, Vasco M. Manquinho, and Inês Lynce. Open-WBO: A modular MaxSAT solver. In Pro- ceedings of the 17th International Conference of Theory and Ap- plications of Satisfiability Testing, Vienna, Austria, pages 438- 445, 2014.","title":"Open-WBO: A modular MaxSAT solver","authors":"Martins","year":"2014","venue":"Proceedings of the 17th International Conference of Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mencía et al., 2015] Carlos Mencía, Alessandro Previti, and João Marques-Silva. Literal-based MCS extraction. In Proceedings of IJCAI-15, pages 1973-1979, 2015.","title":"Literal-based MCS extraction","authors":"Carlos Mencía, Alessandro Previti, João Marques-Silva","year":"2015","venue":"Proceedings of IJCAI-15","doi":null,"url":null,"internal_url":"/proceedings/2015/280"},{"position":20,"raw":"[Morgado et al., 2013] António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, and Joao Marques-Silva. Iterative and core-guided MaxSAT solving: A survey and assessment. Con- straints, 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, Joao Marques-Silva","year":"2013","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Narodytska and Bacchus, 2014] Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using core-guided MaxSAT resolution. In Proceedings of the 28th AAAI Conference on Arti- ficial Intelligence (AAAI), Québec City, Québec, Canada, pages 2717-2723, 2014.","title":"Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using core-guided MaxSAT resolution","authors":"Bacchus Narodytska","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Thornton and Sattar, 1998] John Thornton and Abdul Sattar. Dy- namic constraint weighting for over-constrained problems. In Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence (PRICAI), Singapore, pages 377-388, 1998.","title":"Dynamic constraint weighting for over-constrained problems","authors":"Thornton, Sattar, John Thornton, Abdul Sattar","year":"1998","venue":"Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence (PRICAI)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Thornton et al., 2002] John Thornton, Stuart Bain, Abdul Sattar, and Duc Nghia Pham. A two level local search for MAX-SAT problems with hard and soft constraints. In Proceedings of the 15th Australian Joint Conference on Artificial Intelligence (AI), Canberra, Australia, pages 603-614, 2002.","title":"A two level local search for MAX-SAT problems with hard and soft constraints","authors":"John Thornton, Stuart Bain, Abdul Sattar, Duc Nghia Pham","year":"2002","venue":"Proceedings of the 15th Australian Joint Conference on Artificial Intelligence (AI)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Thornton et al., 2004] John Thornton, Duc Nghia Pham, Stuart Bain, and Valnir Ferreira Jr. Additive versus multiplicative clause weighting for SAT. In Proceedings of the 19th National Con- ference on Artificial Intelligence, (AAAI), San Jose, California, USA, pages 191-196. AAAI Press / The MIT Press, 2004.","title":"Additive versus multiplicative clause weighting for SAT","authors":"John Thornton, Duc Nghia Pham, Stuart Bain, Valnir Ferreira","year":"2004","venue":"Proceedings of the 19th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}