Theory and Applications of Satisfiability Testing – SAT 2021 PDF
Preview Theory and Applications of Satisfiability Testing – SAT 2021
Chu-Min Li Felip Manyà (Eds.) Theory and Applications 1 3 8 of Satisfiability Testing – 2 1 S C SAT 2021 N L 24th International Conference Barcelona, Spain, July 5–9, 2021 Proceedings Lecture Notes in Computer Science 12831 Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA More information about this subseries at http://www.springer.com/series/7407 à Chu-Min Li Felip Many (Eds.) (cid:129) Theory and Applications fi – of Satis ability Testing SAT 2021 24th International Conference – Barcelona, Spain, July 5 9, 2021 Proceedings 123 Editors Chu-MinLi Felip Manyà Laboratoire MIS IIIA-CSIC University of Picardie Jules Verne SpanishNational Research Council (CSIC) Amiens, France Bellaterra, Barcelona,Spain ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-80222-6 ISBN978-3-030-80223-3 (eBook) https://doi.org/10.1007/978-3-030-80223-3 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2021 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the papers presented at the 24th International Conference on Theory and Applications of Satisfiability Testing (SAT 2021), held during July 5–9, 2021,inBarcelona.BecauseoftheCOVID-19pandemic,SAT2021followedahybrid format, with both in-person and virtual participation options. The SAT conference is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. Asidefromplainpropositionalsatisfiability,thescopeofthemeetingincludesBoolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint pro- gramming (CP) for problems with clear connections to Boolean reasoning. Many challenging combinatorial problems can be tackled using SAT-based tech- niques, including problems that arise in formal verification, artificial intelligence, operationsresearch,computationalbiology,cryptology,datamining,machinelearning, mathematics, etc. Indeed, the theoretical and practical advances in SAT research over thepast25yearshavecontributedtomakingSATtechnologyanindispensabletoolin various domains. SAT 2021 welcomed scientific contributions addressing different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proofcomplexity,andothercomplexityissues),practicalsearchalgorithms,knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications (including both novel appli- cation domainsand improvements toexisting approaches), as well ascase studies and reports on findings based on rigorous experimentation. SAT2021received73submissions,comprising44longpapers,18shortpapers,and 11 tool papers. At least three Program Committee members reviewed each paper. The reviewing process included an author response period, during which the authors were giventheopportunitytorespondtotheinitialreviewsfortheirsubmissions.Toreacha final decision, a Program Committee discussion period followed the author response period. External reviewers supporting the Program Committee were also invited to participate directly in the discussion for the papers they reviewed. This year, most submissionsreceivedameta-review,summarizingthediscussionthatoccurredafterthe author response and an explanation of the final recommendation. In the end, the ProgramCommitteedecidedtoacceptatotalof37papers:25long,3short,and9tool papers. The Program Committee singled out the following two submissions for the Best Paper Award and the Best Student Paper Award, respectively: – ShaoweiCaiandXindiZhang:“Deep CooperationofCDCLand Local Search for SAT”. – Alexis de Colnet and Stefan Mengel: “Characterizing Tseitin-Formulas with Short Regular Resolution Refutations”. vi Preface In addition to presentations on the accepted papers, the scientific program of SAT included two invited talks by the following speakers: – Carlos Ansótegui, University of Lleida, Spain. – Adnan Darwiche, University of California, Los Angeles (UCLA), USA. The conference hosted various associated events. In particular, the following three workshops, affiliated with SAT-2021, were held July 5–6, 2021: – InternationalWorkshoponModelCountingandSampling(MCW2021),organized by Johannes K. Fichte, Kuldeep Meel, Markus Hecher, and Mate Soos. – PragmaticsofSATWorkshop(PoS2021),organizedbyMattiJärvisaloandDaniel Le Berre. – Quantified Boolean Formulas and Beyond Workshop (QBF 2021), organized by Hubie Chen, Florian Lonsing, Martina Seidl, and Friedrich Slivovsky. The results of several competitive events were also announced at SAT 2021: – EDA Challenge 2021, organized by Armin Biere, Chu-Min Li, Felip Manyà, and Zhipeng Lü. – MaxSAT Evaluation 2021, organized by Fahiem Bacchus, Jeremias Berg, Matti Järvisalo, and Ruben Martins. – Model Counting Competition 2021 (MC 2021), organized by Johannes K. Fichte and Markus Hecher. – SAT Competition 2021, organized by Tomáš Balyo, Nils Froleyks, Markus Iser, Marijn Heule, Matti Järvisalo, and Martin Suda. We thank everyone who contributed to making SAT 2021 a success. In particular, we thank the Publicity Chair, Jesús Giráldez; the Workshop Chair, Djamal Habet; the Local Arrangements Chairs, Josep Argelich and Jordi Planes; and all the organizers of the SAT affiliated workshops and competitions. We are indebted to the Program Committee members and the external reviewers, whodedicatedtheirtimetoreviewandevaluatethesubmissionstotheconference.We thank the authors of all submitted papers for their contributions, the SAT Association for their guidance and support in organizing the conference, and the EasyChair con- ference management system for facilitating the submission and selection of papers as well as the assembly of these proceedings. We gratefully thank the sponsors of SAT 2021: The Artificial Intelligence journal and CAS Software AC for providing travel support to students attending the confer- ence, Springer for sponsoring the best paper awards, and the University of Picardie JulesVerneanditsModelling,InformationandSystems(MIS)laboratory,theSpanish National Research Council (CSIC) and its Artificial Intelligence Research Institute (IIIA), and the Spanish Network on Satisfiability and Constraint Programming for financial and organizational support. Finally, we thank Huawei for its support to SAT 2021. May 2021 Chu-Min Li Felip Manyà Organization Program Committee Chairs Chu-Min Li Université de Picardie Jules Verne, France Felip Manyà IIIA-CSIC, Spain Program Committee Gilles Audemard CNRS-Université d’Artois, France Fahiem Bacchus University of Toronto, Canada Jeremias Berg University of Helsinki, Finland Olaf Beyersdorff Friedrich Schiller University Jena, Germany Armin Biere Johannes Kepler University Linz, Austria Miquel Bofill Universitat de Girona, Spain Shaowei Cai Chinese Academy of Sciences, China Jordi Coll Aix-Marseille Université, France Gilles Dequen Université de Picardie Jules Verne, France Fei He Tsinghua University, China Marijn Heule Carnegie Mellon University, USA Alexey Ignatiev Monash University, Australia Mikoláš Janota CzechTechnicalUniversityinPrague,CzechRepublic Jie-Hong Roland Jiang National Taiwan University, Taiwan Matti Järvisalo University of Helsinki, Finland Oliver Kullmann Swansea University, UK Massimo Lauria Sapienza University of Rome, Italy Daniel Le Berre CNRS - Université d’Artois, France Jordi Levy IIIA-CSIC, Spain Zhipeng Lü Huazhong University of Science and Technology, China Inês Lynce INESC-ID/IST, Universidade de Lisboa, Portugal Meena Mahajan The Institute of Mathematical Sciences, India Vasco Manquinho INESC-ID/IST, Universidade de Lisboa, Portugal Joao Marques-Silva IRIT, CNRS, France Ruben Martins Carnegie Mellon University, USA Carlos Mencía University of Oviedo, Spain Stefan Mengel CNRS, CRIL, France Tomáš Peitl Friedrich Schiller University Jena, Germany Luca Pulina University of Sassari, Italy Lakhdar Sais CNRS-Université d’Artois, France Martina Seidl Johannes Kepler University Linz, Austria Laurent Simon Bordeaux Institute of Technology, France Carsten Sinz Karlsruhe Institute of Technology, Germany viii Organization Takehide Soh Kobe University, Japan Ofer Strichman Technion, Israel Zhouxing Su Huazhong University of Science and Technology, China Stefan Szeider TU Wien, Austria Mateu Villaret Universitat de Girona, Spain Toby Walsh University of New South Wales, Australia Additional Reviewers Balyo, Tomáš Hůla, Jan Rabe, Markus N. Bonacina, Ilario Iser, Markus Scheder, Dominik Böhm, Benjamin Ivrii, Alexander Schleitzer, Agnes de Colnet, Alexis Jabbour, Said Semenov, Alexander Dreier, Jan Kochemazov, Stepan Shukla, Ankit Fleming, Noah Korhonen, Tuukka Slivovsky, Friedrich Fleury, Mathias Morgado, Antonio Trimoska, Monika Galesi, Nicola Möhle, Sibylle Xu, Ke Gocht, Stephan Nabeshima, Hidetomo Zaikin, Oleg Contents OptiLog: A Framework for SAT-based Systems . . . . . . . . . . . . . . . . . . . . . 1 Carlos Ansótegui, Jesús Ojeda, Antonio Pacheco, Josep Pon, Josep M. Salvia, and Eduard Torres PyDGGA: Distributed GGA for Automatic Configuration . . . . . . . . . . . . . . 11 Carlos Ansótegui, Josep Pon, Meinolf Sellmann, and Kevin Tierney QBFFam: A Tool for Generating QBF Families from Proof Complexity . . . . 21 Olaf Beyersdorff, Luca Pulina, Martina Seidl, and Ankit Shukla Davis and Putnam Meet Henkin: Solving DQBF with Resolution . . . . . . . . . 30 Joshua Blinkhorn, Tomáš Peitl, and Friedrich Slivovsky Lower Bounds for QCDCL via Formula Gauge . . . . . . . . . . . . . . . . . . . . . 47 Benjamin Böhm and Olaf Beyersdorff Deep Cooperation of CDCL and Local Search for SAT. . . . . . . . . . . . . . . . 64 Shaowei Cai and Xindi Zhang Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers . . . . 82 Henrik Cao Hardness and Optimality in QBF Proof Systems Modulo NP . . . . . . . . . . . . 98 Leroy Chew Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 Alexis de Colnet and Stefan Mengel Weighted Model Counting Without Parameter Variables . . . . . . . . . . . . . . . 134 Paulius Dilkas and Vaishak Belle ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152 Jeffrey M. Dudek, Vu H. N. Phan, and Moshe Y. Vardi Efficient All-UIP Learned Clause Minimization . . . . . . . . . . . . . . . . . . . . . 171 Mathias Fleury and Armin Biere Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 Tobias Friedrich, Frank Neumann, Ralf Rothenberger, and Andrew M. Sutton
The list of books you might like
