{"type":"ScholarlyArticle","title":"CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract)","authors":[{"name":"Chuan Luo","slug":"chuan-luo","given":"Chuan","family":"Luo","affiliation":"Institute of Computing Technology , Chinese Academy of Sciences , China"},{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , China"},{"name":"Kaile Su","slug":"kaile-su","given":"Kaile","family":"Su","affiliation":"College of Information Science and Technology , Jinan University , China"},{"name":"Wenxuan Huang","slug":"wenxuan-huang","given":"Wenxuan","family":"Huang","affiliation":"Department of Material Science and Engineering , Massachusetts Institute of Technology , USA"}],"abstract":"Weighted partial maximum satisfiability (WPMS) is a significant generalization of maximum satisfiability (MAX-SAT), with many important applications. Recently, breakthroughs have been made on stochastic local search (SLS) for weighted MAX-SAT and (unweighted) partial MAX-SAT (PMS). However, the performance of SLS for WPMS lags far behind. In this work, we present a new SLS algorithm named CCEHC for WPMS. CCEHC is mainly based on a heuristic emphasizing hard clauses, which has three components: a variable selection mechanism focusing on configuration checking based only on hard clauses, a weighting scheme for hard clauses, and a biased random walk component. Experiments show that CCEHC significantly outperforms its state-of-the-art SLS competitors. Experiments comparing CCEHC with a state-of-the-art complete solver indicate the effectiveness of CCEHC on a number of application WPMS instances.","doi":"10.24963/ijcai.2017/716","url":"https://ijcai.org/proceedings/2017/716","pdf":"https://ijcai.org/proceedings/2017/0716.pdf","markdown":"https://ijcai.org/proceedings/2017/716.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/716","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Journal track","track":"Journal track","number":716,"pages":{"first":5030,"last":5034},"keywords":["Combinatorial & Heuristic Search: Combinatorial search/optimisation","Combinatorial & Heuristic Search: Heuristic Search","Constraints and Satisfiability: Constraint Optimisation"],"videos":[],"references":[{"position":1,"raw":"[Allouche et al., 2012] David Allouche, Seydou Traoré, Is- abelle André, Simon de Givry, George Katsirelos, Sophie Barbe, and Thomas Schiex. Computational protein design as a cost function network optimization problem. In Pro- ceedings of CP 2012, pages 840-849, 2012.","title":"Computational protein design as a cost function network optimization problem","authors":"David Allouche, Seydou Traoré, Isabelle André, Simon De Givry, George Katsirelos, Sophie Barbe, Thomas Schiex","year":"2012","venue":"Proceedings of CP 2012","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Allouche et al., 2014] David Allouche, Isabelle André, So- phie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steven David Prestwich, Thomas Schiex, and Seydou Traoré. Computational protein design as an optimization problem. Artificial Intelligence, 212:59-79, 2014.","title":"Computational protein design as an optimization problem","authors":"David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon De Givry, George Katsirelos, O' Barry, Steven Sullivan, Thomas David Prestwich, Seydou Schiex, Traoré","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ansótegui and Gabàs, 2013] Carlos Ansótegui and Joel Gabàs. Solving (weighted) partial MaxSAT with ILP. In Proceedings of CPAIOR 2013, pages 403-409, 2013.","title":"Solving (weighted) partial MaxSAT with ILP","authors":"Carlos Ansótegui, Joel Gabàs","year":"2013","venue":"Proceedings of CPAIOR 2013","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ansótegui et al., 2013a] Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, and Jordi Levy. Improving WPM2 for (weighted) partial MaxSAT. In Proceedings of CP 2013, pages 117-132, 2013.","title":"Improving WPM2 for (weighted) partial MaxSAT","authors":"Ansótegui","year":"2013","venue":"Proceedings of CP 2013","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ansótegui et al., 2013b] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms. Artificial Intelligence, 196:77-105, 2013.","title":"Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms","authors":"Ansótegui","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cai et al., 2014] Shaowei Cai, Chuan Luo, John Thornton, and Kaile Su. Tailoring local search for partial MaxSAT. In Proceedings of AAAI 2014, 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 AAAI 2014","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cai et al., 2016] Shaowei Cai, Chuan Luo, Jinkun Lin, and Kaile Su. New local search methods for partial MaxSAT. Artificial Intelligence, 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":8,"raw":"[Gwynne and Kullmann, 2011] Matthew Gwynne and Oliver Kullmann. Towards a better understanding of SAT translations. In The Twelfth International Workshop on Logic and Computational Complexity, 2011.","title":"Towards a better understanding of SAT translations","authors":"Gwynne, Kullmann, Matthew Gwynne, Oliver Kullmann","year":"2011","venue":"The Twelfth International Workshop on Logic and Computational Complexity","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Huang et al., 2016] Wenxuan Huang, Daniil A. Kitchaev, Stephen Dacek, Ziqin Rong, Alexander Urban, Shan Cao, Chuan Luo, and Gerbrand Ceder. Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT. Physical Review B, 94:134424, 2016.","title":"Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT","authors":"Wenxuan Huang, Daniil A Kitchaev, Stephen Dacek, Ziqin Rong, Alexander Urban, Shan Cao, Chuan Luo, Gerbrand Ceder","year":"2016","venue":"Physical Review B","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hutter et al., 2011] Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. Sequential model-based optimiza- tion for general algorithm configuration. In Proceedings of LION 2011, pages 507-523, 2011.","title":"Sequential model-based optimization for general algorithm configuration","authors":"Frank Hutter, H Holger, Kevin Hoos, Leyton-Brown","year":"2011","venue":"Proceedings of LION 2011","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jiang et al., 1995] Yueyun Jiang, Henry Kautz, and Bart Selman. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In First In- ternational Joint Workshop on Artificial Intelligence and Operations Research, 1995.","title":"Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT","authors":"Jiang","year":"1995","venue":"First International Joint Workshop on Artificial Intelligence and Operations Research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Li et al., 2009] Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, and Jordi Planes. Exploiting cycle structures in Max-SAT. In Proceedings of SAT 2009, pages 467-480, 2009.","title":"Exploiting cycle structures in Max-SAT","authors":"Min Chu, Felip Li, Nouredine Manyà, Jordi Ould Mohamedou, Planes","year":"2009","venue":"Proceedings of SAT 2009","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lin et al., 2008] Han Lin, Kaile Su, and Chu Min Li. Within-problem learning for efficient lower bound compu- tation in Max-SAT solving. In Proceedings of AAAI 2008, pages 351-356, 2008.","title":"Within-problem learning for efficient lower bound computation in Max-SAT solving","authors":"Han Lin, Kaile Su, Chu Min, Li","year":"2008","venue":"Proceedings of AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Luo et al., 2015a] Chuan Luo, Shaowei Cai, Kaile Su, and Wei Wu. Clause states based configuration checking in local search for satisfiability. IEEE Transactions on Cy- bernetics, 45(5):1014-1027, 2015.","title":"Clause states based configuration checking in local search for satisfiability","authors":"Luo","year":"2015","venue":"IEEE Transactions on Cybernetics","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Luo et al., 2015b] Chuan Luo, Shaowei Cai, Wei Wu, Zhong Jie, and Kaile Su. CCLS: An efficient local search algorithm for weighted maximum satisfiability. IEEE Transactions on Computers, 64(7):1830-1843, 2015.","title":"CCLS: An efficient local search algorithm for weighted maximum satisfiability","authors":"Luo","year":"2015","venue":"IEEE Transactions on Computers","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Luo et al., 2017] Chuan Luo, Shaowei Cai, Kaile Su, and Wenxuan Huang. CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability. Artificial Intelligence, 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":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Narodytska and Bacchus, 2014] Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using core- guided MaxSAT resolution. In Proceedings of AAAI 2014, pages 2717-2723, 2014.","title":"Nina Narodytska and Fahiem Bacchus. Maximum satisfiability using coreguided MaxSAT resolution","authors":"Bacchus Narodytska","year":"2014","venue":"Proceedings of AAAI 2014","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sánchez et al., 2008] Martí Sánchez, Simon de Givry, and Thomas Schiex. Mendelian error detection in com- plex pedigrees using weighted constraint satisfaction tech- niques. Constraints, 13(1-2):130-154, 2008.","title":"Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques","authors":"Sánchez","year":"2008","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Selman et al., 1992] Bart Selman, Hector J. Levesque, and David G. Mitchell. A new method for solving hard sat- isfiability problems. In Proceedings of AAAI 1992, pages 440-446, 1992.","title":"A new method for solving hard satisfiability problems","authors":"Bart Selman, Hector J Levesque, David G Mitchell","year":"1992","venue":"Proceedings of AAAI 1992","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Selman et al., 1994] Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proceedings of AAAI 1994, pages 337-343, 1994.","title":"Noise strategies for improving local search","authors":"Bart Selman, Henry A Kautz, Bram Cohen","year":"1994","venue":"Proceedings of AAAI 1994","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Smyth et al., 2003] Kevin Smyth, Holger H. Hoos, and Thomas Stützle. Iterated robust tabu search for MAX- SAT. In Proceedings of Canadian Conference on AI 2003, pages 129-144, 2003.","title":"Iterated robust tabu search for MAX-SAT","authors":"Kevin Smyth, H Holger, Thomas Hoos, Stützle","year":"2003","venue":"Proceedings of Canadian Conference on AI 2003","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Thornton et al., 2004] John Thornton, Duc Nghia Pham, Stuart Bain, and Valnir Ferreira Jr. Additive versus multi- plicative clause weighting for SAT. In Proc of AAAI 2004, pages 191-196, 2004.","title":"Additive versus multiplicative clause weighting for SAT","authors":"John Thornton, Duc Nghia Pham, Stuart Bain, Valnir Ferreira","year":"2004","venue":"Proc of AAAI 2004","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}