{"type":"ScholarlyArticle","title":"Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method","authors":[{"name":"Marijn J.H. Heule","slug":"marijn-j-h-heule","given":"Marijn J.H.","family":"Heule","affiliation":"The University of Texas at Austin"},{"name":"Oliver Kullmann","slug":"oliver-kullmann","given":"Oliver","family":"Kullmann","affiliation":"Swansea University , UK"},{"name":"Victor W. Marek","slug":"victor-w-marek","given":"Victor W.","family":"Marek","affiliation":"University of Kentucky"}],"abstract":"A recent success of SAT solving has been the solution of the boolean Pythagorean Triples problem [Heule et al., 2016], delivering the largest proof yet, of 200 terabytes in size. We present this and the underlying paradigm Cube-and-Conquer, a powerful general method to solve big SAT problems, based on integrating the “old” and “new” methods of SAT solving.","doi":"10.24963/ijcai.2017/683","url":"https://ijcai.org/proceedings/2017/683","pdf":"https://ijcai.org/proceedings/2017/0683.pdf","markdown":"https://ijcai.org/proceedings/2017/683.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/683","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":"Best Sister Conferences","track":"Best Sister Conferences","number":683,"pages":{"first":4864,"last":4868},"keywords":["Artificial Intelligence: search and constraint satisfaction"],"videos":[],"references":[{"position":1,"raw":"[Ahmed et al., 2014] Tanbir Ahmed, Oliver Kullmann, and Hunter Snevily. On the van der Waerden numbers w(2; 3, t). Discrete Applied Mathematics, 174:27-51, September 2014.","title":"On the van der Waerden numbers w(2; 3, t)","authors":"Ahmed","year":"2014","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Biere et al., 2009] Armin Biere, Marijn J.H. Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satis- fiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, February 2009.","title":"Handbook of Satisfiability","authors":null,"year":"2009","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Codish et al., 2016] Michael Codish, Michael Frank, Avra- ham Itzhakov, and Alice Miller. Computing the Ramsey number R(4,3,3) using abstraction and symmetry break- ing. Constraints, 21(3):375-393, July 2016.","title":"Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking","authors":"Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller","year":"2016","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Croot and Lev, 2006] Ernie Croot and Vsevolod F. Lev. Open problems in additive combinatorics. In Andrew Granville, Melvyn B. Nathanson, and József Solymosi, ed- itors, Additive Combinatorics, CRM Proceedings & Lec- ture Notes, pages 207-234. American Mathematical Soci- ety, 2006.","title":"Open problems in additive combinatorics","authors":"Ernie Croot, F Vsevolod, Lev","year":"2006","venue":"Additive Combinatorics, CRM Proceedings & Lecture Notes","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cruz-Filipe et al., 2016] Luís Cruz-Filipe, Joao Marques- Silva, and Peter Schneider-Kamp. Efficient certi- fied resolution proof checking. Technical Report arXiv:1610.06984v2 [cs.LO], arXiv, October 2016.","title":"Efficient certified resolution proof checking","authors":"Luís Cruz-Filipe, Joao Marques-Silva, Peter Schneider-Kamp","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Davis et al., 1962] Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem- proving. Communications of the ACM, 5(7):394-397, July 1962.","title":"A machine program for theoremproving","authors":"Martin Davis, George Logemann, Donald Loveland","year":"1962","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Edwards, 2016] Chris Edwards. Automating proofs. Com- munications of the ACM, 59(4):13-15, April 2016.","title":"Automating proofs","authors":"Chris Edwards","year":"2016","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Graham et al., 1990] Ronald Lewis Graham, Bruce L. Rothschild, and Joel H. Spencer. Ramsey theory. Wiley- Interscience series in discrete mathematics and optimiza- tion. J. Wiley & sons, New York, Chichester, Brisbane, 1990.","title":"Wiley-Interscience series in discrete mathematics and optimization","authors":"Ronald Lewis Graham, Bruce L Rothschild, Joel H Spencer","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Heule and Kullmann, 2017 to appear]","title":null,"authors":"Kullmann Heule","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Marijn J. H. Heule and Oliver Kullmann. The science of brute force. Com- munications of the ACM, 2017, to appear.","title":"The science of brute force","authors":"J H Marijn, Oliver Heule, Kullmann","year":"2017","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Heule and van Maaren, 2009] Marijn J. H. Heule and Hans van Maaren. Look-ahead based SAT solvers. In Biere et al. [2009], chapter 5, pages 155-184.","title":"Look-ahead based SAT solvers","authors":"J H Marijn, Heule, Hans Van Maaren","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Heule et al., 2012] Marijn J. H. Heule, Oliver Kullmann, Siert Wieringa, and Armin Biere. Cube and conquer: Guiding CDCL SAT solvers by lookaheads. In Kerstin Eder, João Lourenc ¸o, and Onn Shehory, editors, Hardware and Software: Verification and Testing (HVC 2011), vol- ume 7261 of Lecture Notes in Computer Science (LNCS), pages 50-65. Springer, 2012.","title":"Cube and conquer: Guiding CDCL SAT solvers by lookaheads","authors":"J H Marijn, Heule, Siert Oliver Kullmann, Armin Wieringa, Biere","year":"2012","venue":"Hardware and Software: Verification and Testing (HVC 2011)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Heule et al., 2016] Marijn J. H. Heule, Oliver Kullmann, and Victor W. Marek. Solving and verifying the boolean Pythagorean Triples problem via Cube-and-Conquer. In Nadia Creignou and Daniel Le Berre, editors, Theory and Applications of Satisfiability Testing -SAT 2016, volume 9710 of Lecture Notes in Computer Science, pages 228- 245. Springer, 2016.","title":"Solving and verifying the boolean Pythagorean Triples problem via Cube-and-Conquer","authors":"J H Marijn, Heule, Victor W Oliver Kullmann, Marek","year":"2016","venue":"Theory and Applications of Satisfiability Testing -SAT 2016","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kautz et al., 2009] Henry A. Kautz, Ashish Sabharwal, and Bart Selman. Incomplete algorithms. In Biere et al. [2009], chapter 6, pages 185-203.","title":"Incomplete algorithms","authors":"Henry A Kautz, Ashish Sabharwal, Bart Selman","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Konev and Lisitsa, 2015] Boris Konev and Alexei Lisitsa. Computer-aided proof of Erdös discrepancy properties. Artificial Intelligence, 224:103-118, July 2015.","title":"Computer-aided proof of Erdös discrepancy properties","authors":"Lisitsa Konev","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kouril and Paul, 2008] Michal Kouril and Jerome L. Paul. The van der Waerden number W (2, 6) is 1132. Experi- mental Mathematics, 17(1):53-61, 2008.","title":"The van der Waerden number W (2, 6) is 1132","authors":"Paul ; Kouril, Michal Kouril, Jerome L Paul","year":"2008","venue":"Experimental Mathematics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kullmann, 2009] Oliver Kullmann. Fundaments of branch- ing heuristics. In Biere et al. [2009], chapter 7, pages 205- 244.","title":"Fundaments of branching heuristics","authors":"Oliver Kullmann","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lam, 1991] C. W. H. Lam. The search for a finite projective plane of order 10. The American Mathematical Monthly, 98(4):305-318, April 1991.","title":"The search for a finite projective plane of order 10","authors":"C W H Lam","year":"1991","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lamb, 2016] Evelyn Lamb. Maths proof smashes size record: Supercomputer produces a 200-terabyte proof - but is it really mathematics? Nature, 534:17-18, June 2016.","title":"Maths proof smashes size record: Supercomputer produces a 200-terabyte proofbut is it really mathematics","authors":"Evelyn Lamb","year":"2016","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Marques-Silva et al., 2009] Joao P. Marques-Silva, Ines Lynce, and Sharad Malik. Conflict-driven clause learn- ing SAT solvers. In Biere et al. [2009], chapter 4, pages 131-153.","title":"Conflict-driven clause learning SAT solvers","authors":"Joao P Marques-Silva, Ines Lynce, Sharad Malik","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Pipatsrisawat and Darwiche, 2011] Knot Pipatsrisawat and Adnan Darwiche. On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence, 175(2):512-525, 2011.","title":"Knot Pipatsrisawat and Adnan Darwiche. On the power of clause-learning SAT solvers as resolution engines","authors":"Darwiche Pipatsrisawat","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Rossi et al., 2006] Francesca Rossi, Peter van Beek, and Toby Walsh, editors. Handbook of Constraint Program- ming. Foundations of Artificial Intelligence. Elsevier, 2006.","title":"Handbook of Constraint Programming","authors":null,"year":"2006","venue":"Foundations of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Schur, 1917] Issai Schur. Über die Kongruenz x m + y m = z m (mod p). Jahresbericht der Deutschen Mathematik- ervereinigung, 25:114-117, 1917.","title":"Über die Kongruenz x m + y m = z m (mod p)","authors":"Issai Schur","year":"1917","venue":"Jahresbericht der Deutschen Mathematikervereinigung","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wetzler et al., 2014] Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt. Drat-trim: Efficient checking and trimming using expressive clausal proofs. In SAT, pages 422-429. Springer, 2014.","title":"Drat-trim: Efficient checking and trimming using expressive clausal proofs","authors":"Nathan Wetzler, J H Marijn, Warren A Heule, Hunt","year":"2014","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Wilson, 2013] Robin Wilson. Four Colors Suffice: How the Map Problem Was Solved. Princeton University Press, re- vised edition, 2013.","title":"Four Colors Suffice: How the Map Problem Was Solved","authors":"Wilson ;, Robin Wilson","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}