{"type":"ScholarlyArticle","title":"Reduced Cost Fixing for Maximum Satisfiability","authors":[{"name":"Fahiem Bacchus","slug":"fahiem-bacchus","given":"Fahiem","family":"Bacchus","affiliation":"Department of Computer Science , University of Toronto , Canada; and DoCS Doctoral Programme in Computer Science , University of Helsinki."},{"name":"Antti Hyttinen","slug":"antti-hyttinen","given":"Antti","family":"Hyttinen","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"},{"name":"Matti Järvisalo","slug":"matti-jarvisalo","given":"Matti","family":"Järvisalo","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"},{"name":"Paul Saikko","slug":"paul-saikko","given":"Paul","family":"Saikko","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"}],"abstract":"Maximum satisfiability (MaxSAT) offers a competitive approach to solving NP-hard real-world optimization problems. While state-of-the-art MaxSAT\r\nsolvers rely heavily on Boolean satisfiability (SAT) solvers, a recent trend, brought on by MaxSAT solvers implementing the so-called implicit hitting\r\nset (IHS) approach, is to integrate techniques from the realm of integer programming (IP) into the solving process. This allows for making use of additional\r\nIP solving techniques to further speed up MaxSAT solving. In this line of work, we investigate the integration of the technique of reduced cost\r\nfixing from the IP realm into IHS solvers, and empirically show that reduced cost fixing considerable speeds up a state-of-the-art MaxSAT solver implementing\r\nthe IHS approach.","doi":"10.24963/ijcai.2018/723","url":"https://ijcai.org/proceedings/2018/723","pdf":"https://ijcai.org/proceedings/2018/0723.pdf","markdown":"https://ijcai.org/proceedings/2018/723.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/723","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":"Sister Conferences Best Papers","track":"Best Sister Conferences","number":723,"pages":{"first":5209,"last":5213},"keywords":["Constraints and SAT: Constraint Optimisation","Constraints and SAT: MaxSAT, MinSAT"],"videos":[],"references":[{"position":1,"raw":"[Ansótegui et al., 2015] Carlos Ansótegui, Frédéric Didier, and Joel Gabàs. Exploiting the structure of unsatisfiable cores in MaxSAT. In Proc. IJCAI, pages 283-289, 2015.","title":"Exploiting the structure of unsatisfiable cores in MaxSAT","authors":"Carlos Ansótegui, Frédéric Didier, Joel Gabàs","year":"2015","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/46"},{"position":2,"raw":"[Bacchus et al., 2017] Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko. Reduced cost fixing in MaxSAT. In Proc. CP, volume 10416 of LNCS, pages 641-651. Springer, 2017.","title":"Reduced cost fixing in MaxSAT","authors":"Bacchus","year":"2017","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chvátal, 1983] Vašek Chvátal. Linear Programming. Free- man, 1983.","title":"Linear Programming. Freeman","authors":"Vašek Chvátal","year":"1983","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Crowder et al., 1983] Harlan Crowder, Ellis L. Johnson, and Manfred Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31(5):803- 834, 1983.","title":"Solving large-scale zero-one linear programming problems","authors":"Harlan Crowder, Ellis L Johnson, Manfred Padberg","year":"1983","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Danzig et al., 1954] George B. Danzig, Delbert R. Fulker- son, and Selmer M. Johnson. Solution of a large-scale traveling-salesman problem. Operations Research, 2:393- 410, 1954.","title":"Solution of a large-scale traveling-salesman problem","authors":"George B Danzig, Delbert R Fulkerson, Selmer M Johnson","year":"1954","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Davies and Bacchus, 2011] Jessica Davies and Fahiem Bac- chus. Solving MAXSAT by solving a sequence of simpler SAT instances. In Proc. CP, volume 6876 of LNCS, pages 225-239. Springer, 2011.","title":"Jessica Davies and Fahiem Bacchus. Solving MAXSAT by solving a sequence of simpler SAT instances","authors":"Bacchus Davies","year":"2011","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Davies and Bacchus, 2013a] Jessica Davies and Fahiem Bacchus. Exploiting the power of MIP solvers in MaxSAT. In Proc. SAT, volume 7962 of LNCS, pages 166-181. Springer, 2013.","title":"Exploiting the power of MIP solvers in MaxSAT","authors":"Bacchus Davies, Jessica Davies, Fahiem Bacchus","year":"2013","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Davies and Bacchus, 2013b] Jessica Davies and Fahiem Bacchus. Postponing optimization to speed up MAXSAT solving. In Proc. CP, volume 8124 of LNCS, pages 247- 262. Springer, 2013.","title":"Postponing optimization to speed up MAXSAT solving","authors":"Bacchus Davies, Jessica Davies, Fahiem Bacchus","year":"2013","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Davies, 2013] Jessica Davies. Solving MAXSAT by Decoupling Optimization and Satisfaction. PhD thesis, University of Toronto, 2013. http: //www.cs.toronto.edu/ ˜jdavies/Davies_ Jessica_E_201311_PhD_thesis.pdf.","title":"Solving MAXSAT by Decoupling Optimization and Satisfaction","authors":"Jessica Davies","year":"2013","venue":null,"doi":null,"url":"http://www.cs.toronto.edu/˜jdavies/Davies_Jessica_E_201311_PhD_thesis.pdf","internal_url":null},{"position":10,"raw":"[Focacci et al., 1999] Filippo Focacci, Andrea Lodi, and Michela Milano. Cost-based domain filtering. In Proc. CP, volume 1713 of LNCS, pages 189-203. Springer, 1999.","title":"Cost-based domain filtering","authors":"Filippo Focacci, Andrea Lodi, Michela Milano","year":"1999","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Heras et al., 2012] Federico Heras, António Morgado, and João Marques-Silva. Lower bounds and upper bounds for MaxSAT. In Proc. LION 6, volume 7219 of LNCS, pages 402-407. Springer, 2012.","title":"Lower bounds and upper bounds for MaxSAT","authors":"Federico Heras, António Morgado, João Marques-Silva","year":"2012","venue":"Proc. LION 6","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Karp, 2010] Richard M. Karp. Implicit hitting set problems and multi-genome alignment. In Proc. CPM, volume 6129 of LNCS, page 151. Springer, 2010.","title":"Implicit hitting set problems and multi-genome alignment","authors":"Richard M Karp","year":"2010","venue":"Proc. CPM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Koshimura et al., 2012] Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, and Ryuzo Hasegawa. QMaxSAT: A par- tial Max-SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 8(1/2):95-100, 2012.","title":"QMaxSAT: A partial Max-SAT solver","authors":"Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa","year":"2012","venue":"Boolean Modeling and Computation","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Li et al., 2006] Chu Min Li, Felip Manyà, and Jordi Planes. Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In Proc. AAAI, pages 86-91. AAAI Press, 2006.","title":"Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT","authors":"Min Chu, Felip Li, Jordi Manyà, Planes","year":"2006","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Li et al., 2008] Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, and Jordi Planes. Transforming inconsis- tent subformulas in MaxSAT lower bound computation. In Proc. CP, volume 5202 of LNCS, pages 582-587. Springer, 2008.","title":"Transforming inconsistent subformulas in MaxSAT lower bound computation","authors":"Min Chu, Felip Li, Nouredine Manyà, Jordi Ould Mohamedou, Planes","year":"2008","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lin and Su, 2007] Han Lin and Kaile Su. Exploiting infer- ence rules to compute lower bounds for MAX-SAT solv- ing. In Proc. IJCAI, pages 2334-2339, 2007.","title":"Exploiting inference rules to compute lower bounds for MAX-SAT solving","authors":"Lin, Su ; ] Han, Lin, Kaile Su","year":"2007","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/376"},{"position":17,"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 Proc. AAAI, pages 351-356. AAAI Press, 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":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Martins et al., 2014] Ruben Martins, Vasco M. Manquinho, and Inês Lynce. Open-WBO: A modular MaxSAT solver. In Proc. SAT, volume 8561 of LNCS, pages 438-445. Springer, 2014.","title":"Open-WBO: A modular MaxSAT solver","authors":"Ruben Martins, M Vasco, Inês Manquinho, Lynce","year":"2014","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Moreno-Centeno and Karp, 2013] Erick Moreno-Centeno and Richard M. Karp. The implicit hitting set approach to solve combinatorial optimization problems with an appli- cation to multigenome alignment. Operations Research, 61(2):453-468, 2013.","title":"The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment","authors":"Moreno-Centeno, ; ] Erick Karp, Richard M Moreno-Centeno, Karp","year":"2013","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Morgado et al., 2012] António Morgado, Federico Heras, and João Marques-Silva. Improvements to core-guided bi- nary search for MaxSAT. In Proc. SAT, volume 7317 of LNCS, pages 284-297. Springer, 2012.","title":"Improvements to core-guided binary search for MaxSAT","authors":"António Morgado, Federico Heras, João Marques-Silva","year":"2012","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Morgado et al., 2014] António Morgado, Carmine Dodaro, and Joao Marques-Silva. Core-guided MaxSAT with soft cardinality constraints. In Proc. CP, volume 8656 of LNCS, pages 564-573. Springer, 2014.","title":"Core-guided MaxSAT with soft cardinality constraints","authors":"António Morgado, Carmine Dodaro, Joao Marques-Silva","year":"2014","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Nemhauser and Wolsey, 1999] George L. Nemhauser and Laurence A. Wolsey. Integer and Combinatorial Opti- mization. Wiley-Interscience, 1999.","title":"Integer and Combinatorial Optimization","authors":"George L Nemhauser, Laurence A Wolsey","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Saikko et al., 2016a] Paul Saikko, Jeremias Berg, and Matti Järvisalo. LMHS: A SAT-IP hybrid MaxSAT solver. In Proc. SAT, volume 9710 of LNCS, pages 539-546. Springer, 2016.","title":"LMHS: A SAT-IP hybrid MaxSAT solver","authors":"Saikko","year":"2016","venue":"Proc. SAT, volume 9710 of LNCS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Saikko et al., 2016b] Paul Saikko, Johannes Peter Wallner, and Matti Järvisalo. Implicit hitting set algorithms for rea- soning beyond NP. In Proc. KR, pages 104-113. AAAI Press, 2016.","title":"Implicit hitting set algorithms for reasoning beyond NP","authors":"Saikko","year":"2016","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Saikko, 2015] Paul Saikko. Re-implementing and extend- ing a hybrid SAT-IP approach to maximum satisfiability. Master's thesis, University of Helsinki, 2015. http: //hdl.handle.net/10138/159186.","title":"Re-implementing and extending a hybrid SAT-IP approach to maximum satisfiability","authors":"Paul Saikko","year":"2015","venue":null,"doi":null,"url":"http://hdl.handle.net/10138/159186","internal_url":null},{"position":26,"raw":"[Thorsteinsson and Ottosson, 2002] Erlendur S. Thorsteins- son and Greger Ottosson. Linear relaxations and reduced- cost based propagation of continuous variable subscripts. Annals of Operations Research, 115(1-4):15-29, 2002.","title":"Linear relaxations and reducedcost based propagation of continuous variable subscripts","authors":"S Erlendur, Greger Thorsteinsson, Ottosson","year":"2002","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wolsey, 1998] Laurence A. Wolsey. Integer Programming. John Wiley, 1998.","title":"Integer Programming","authors":"Laurence A Wolsey","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Yunes et al., 2010] Tallys H. Yunes, Ionut D. Aron, and John N. Hooker. An integrated solver for optimization problems. Operations Research, 58(2):342-356, 2010.","title":"An integrated solver for optimization problems","authors":"H Tallys, Yunes, D Ionut, John N Aron, Hooker","year":"2010","venue":"Operations Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}