{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T17:47:53Z","timestamp":1789235273128,"version":"build-2803163510"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>The science of less-than-brute force.<\/jats:p>","DOI":"10.1145\/3500921","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T14:29:42Z","timestamp":1655821782000},"page":"64-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["When satisfiability solving meets symbolic computation"],"prefix":"10.1145","volume":"65","author":[{"given":"Curtis","family":"Bright","sequence":"first","affiliation":[{"name":"University of Windsor, Ontario, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilias","family":"Kotsireas","sequence":"additional","affiliation":[{"name":"Wilfrid Laurier University, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756636"},{"key":"e_1_2_1_2_1","first-page":"6","article-title":"SC2: When satisfiability checking and symbolic computation join forces. G. and Traytel, D., eds. In Proceedings of 1st Intern. Workshop on Automated Reasoning: Challenges, Applications, Directions","volume":"51","author":"\u00c1brah\u00e1m E.","year":"2017","unstructured":"\u00c1brah\u00e1m, E., et al. SC2: When satisfiability checking and symbolic computation join forces. G. and Traytel, D., eds. In Proceedings of 1st Intern. Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements. EPiC Series in Computing 51, 2017, 6--10.","journal-title":"Exemplary Achievements. EPiC Series in Computing"},{"key":"e_1_2_1_3_1","first-page":"3","article-title":"Every planar map is four colorable","volume":"21","author":"Appel K.","year":"1977","unstructured":"Appel, K. and Haken, W. Every planar map is four colorable. Part I: Discharging. Illinois J. Mathematics 21, 3 (1977), 429--490.","journal-title":"Part I: Discharging. Illinois J. Mathematics"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16483"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/203"},{"key":"e_1_2_1_6_1","first-page":"3","article-title":"A nonexistence certificate for projective planes of order ten with weight 15 codewords. Applicable Algebra in Engineering","volume":"31","author":"Bright C.","year":"2020","unstructured":"Bright, C., Cheung, K., Stevens, B., Roy, D., Kotsireas, I., and Ganesh, V. A nonexistence certificate for projective planes of order ten with weight 15 codewords. Applicable Algebra in Engineering, Communication and Computing 31, 3 (2020), 195--213.","journal-title":"Communication and Computing"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45641-6_9"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41258-6_15"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.024"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3016510"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.10.013"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.021"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.020"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1949-009-2"},{"key":"e_1_2_1_16_1","volume-title":"Workshop on Combinatorial Algorithms","author":"Clarkson K.","year":"2014","unstructured":"Clarkson, K. and Whitesides, S. On the non-existence of maximal 6-arcs in projective planes of order 10. In Poster session at the 25th Intern. Workshop on Combinatorial Algorithms, 2014."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.017"},{"key":"e_1_2_1_18_1","first-page":"100","article-title":"Symmetric explanation learning: Effective dynamic symmetry handling for SAT. In Theory and Applications of Satisfiability Testing---SAT 2017","volume":"83","author":"Devriendt J.","year":"2017","unstructured":"Devriendt, J., Bogaerts, B., and Bruynooghe, M. Symmetric explanation learning: Effective dynamic symmetry handling for SAT. In Theory and Applications of Satisfiability Testing---SAT 2017. Springer Intern. Publishing, 2017, 83--100.","journal-title":"Springer Intern. Publishing"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90495-F"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9862-z"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1963.11990035"},{"key":"e_1_2_1_22_1","first-page":"1","article-title":"question relative aux d\u00e9terminants","volume":"17","author":"Hadamard J.","year":"1893","unstructured":"Hadamard, J. R\u00e9solution d'une question relative aux d\u00e9terminants. Bulletin des Sciences Mathematiques 17, 1 (1893), 240--246.","journal-title":"Bulletin des Sciences Mathematiques"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_2_1_24_1","volume-title":"The Kepler Conjecture: The Hales-Ferguson Proof","author":"Hales T.","year":"2011","unstructured":"Hales, T. and Ferguson, S. The Kepler Conjecture: The Hales-Ferguson Proof. Springer Science & Business Media, 2011."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12209"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3107239"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.023"},{"key":"e_1_2_1_29_1","volume-title":"ReaS: Combining numerical optimization with SAT solving","author":"Inala J.","year":"2018","unstructured":"Inala, J., Gao, S., Kong, S., and Solar-Lezama, A. ReaS: Combining numerical optimization with SAT solving, 2018; arXiv:1802.04408."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592434.1592438"},{"key":"e_1_2_1_31_1","first-page":"18","article-title":"SAT, computer algebra, multipliers. The 5th and 6th Vampire Workshops 71 of EPiC Series in Computing. L. Kov\u00e1cs, and A. Voronkov, eds","volume":"1","author":"Kaufmann D.","year":"2020","unstructured":"Kaufmann, D., Biere, A., and Kauers, M. SAT, computer algebra, multipliers. The 5th and 6th Vampire Workshops 71 of EPiC Series in Computing. L. Kov\u00e1cs, and A. Voronkov, eds. EasyChair, 2020, 1--18.","journal-title":"EasyChair"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1991.12000759"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90091-9"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1989-049-4"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90064-2"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337611"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_2_1_38_1","first-page":"114","article-title":"CDCLSym: Introducing effective symmetry breaking in SAT solving","volume":"99","author":"Metin H.","year":"2018","unstructured":"Metin, H., Baarir, S., Colange, M., and Kordon, F. CDCLSym: Introducing effective symmetry breaking in SAT solving. Tools and Algorithms for the Construction and Analysis of Systems. Springer Intern. Publishing, 2018, 99--114.","journal-title":"Springer Intern. Publishing"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"e_1_2_1_41_1","volume-title":"Confirmation of the non-existence of a projective plane of order 10. Master's thesis","author":"Roy D.","year":"2011","unstructured":"Roy, D. Confirmation of the non-existence of a projective plane of order 10. Master's thesis, Carleton University, 2011."},{"key":"e_1_2_1_42_1","first-page":"4","article-title":"Exploiting symmetry in a structure-aware satisfiability solver","volume":"14","author":"Sabharwal A.","year":"2008","unstructured":"Sabharwal, A. SymChaff: Exploiting symmetry in a structure-aware satisfiability solver. Constraints 14, 4 (Oct. 2008), 478--505.","journal-title":"Constraints"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578043"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-44-01108-7"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9396-y"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_41"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3500921","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3500921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:40Z","timestamp":1750182580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3500921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":44,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3500921"],"URL":"https:\/\/doi.org\/10.1145\/3500921","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"2022-06-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}