Theory and Applications of Satisfiability Testing – SAT 2019: 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings PDF
Preview Theory and Applications of Satisfiability Testing – SAT 2019: 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings
Mikoláš Janota Inês Lynce (Eds.) Theory and Applications 8 2 6 of Satisfiability Testing – 1 1 S C SAT 2019 N L 22nd International Conference, SAT 2019 Lisbon, Portugal, July 9–12, 2019 Proceedings Lecture Notes in Computer Science 11628 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board Members David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology Madras, Chennai, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA More information about this series at http://www.springer.com/series/7407 áš ê Mikol Janota In s Lynce (Eds.) (cid:129) Theory and Applications fi – of Satis ability Testing SAT 2019 22nd International Conference, SAT 2019 – Lisbon, Portugal, July 9 12, 2019 Proceedings 123 Editors Mikoláš Janota Inês Lynce University of Lisbon University of Lisbon Lisbon, Portugal Lisbon, Portugal ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-24257-2 ISBN978-3-030-24258-9 (eBook) https://doi.org/10.1007/978-3-030-24258-9 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2019 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 SAT 2019: the 22nd International ConferenceonTheoryandApplicationsofSatisfiabilityTestingheldduringJuly9–12, 2019, in Lisbon. The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean 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 hard combinatorial problems can be tackled using SAT-based techniques, including problems that arise in formal verification, artificial intelligence, operations research, computational biology, cryptology, data mining, machine learning, mathematics, etc. Indeed, the theoretical and practical advances in SAT research over thepast25yearshavecontributedtomakingSATtechnologyanindispensabletoolin a variety of domains. SAT 2019 welcomed scientific contributions addressing different aspects of SAT interpretedinabroadsense,including(butnotrestrictedto)theoreticaladvances(such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation. SAT2019received64submissions,comprising45longpapers,15shortpapers,and four tool papers. Each submission was reviewed by at least three Program Committee members.Thereviewingprocessincludedanauthorresponseperiod,duringwhichthe authors of the submitted papers were given the opportunity to respond to the initial reviews for their submissions. To reach a 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 submissions received a meta-review, summarizingthediscussionthatoccurredaftertheauthorresponseandanexplanation ofthe finalrecommendation.In theend,the committee decidedtoaccept atotal of28 papers; 19 long, seven short, and two tool papers. The Program Committee singled out the following two submissions for the Best Paper Award and the Best Student Paper Award, respectively: – Nikhil Vyas and Ryan Williams: “On Super Strong ETH” – Katalin Fazekas, Armin Biere, and Christoph Scholl: “Incremental Inprocessing in SAT Solving” vi Preface In addition to presentations on the accepted papers, the scientific program of SAT included two invited talks: – Carla Gomes (Cornell University, USA): “Computational Sustainability: Comput- ing for a Better World” – Josef Urban (Czech Technical University in Prague, Czech Republic): “Machine Learning in Automated and Interactive Theorem Proving” SAT 2019 hosted various associated events. In particular, the SAT/SMT/AR summer school was held July 3–6, organized by Alexey Ignatiev, António Morgado, Nina Narodytska, and Vasco Manquinho. In addition, the following five workshops were held July 7–8, affiliated with SAT: – Workshop on Satisfiability Modulo Theories, organized by Joe Hendrix and Natasha E. Sharygina – QBF Workshop, organized by Hubie Chen, Florian Lonsing, Martina Seidl, and Friedrich Slivovsky – Vampire Workshop, organized by Laura Kovacs and Andrei Voronkov – Pragmatics of SAT Workshop, organized by Matti Järvisalo and Daniel Le Berre – Workshop on Logic and Search, organized by David Mitchell Asinthepreviousyears,theresultsofseveralcompetitiveeventswereannouncedat SAT: – SAT Race 2019, organized by Marijn Heule, Matti Järvisalo, and Martin Suda – MaxSAT Evaluation 2019, organized by Fahiem Bacchus, Matti Järvisalo, and Ruben Martins – QBFEVAL 2019, organized by Luca Pulina, Martina Seidl, and Ankit Shukla We thank everyone who contributed to making SAT 2019 a success. We are indebted to the Program Committee members and the external reviewers, who dedicated their time to review and evaluate the submissions to the conference. We thank the authors of all submitted papers for their contributions, the SAT association fortheirguidanceandsupportinorganizing theconference,theEasyChairconference management system for facilitating the submission and selection of papers as well as the assembly of these proceedings. We wish to thank the workshop chair, Vasco Manquinho, and all the organizers of the SAT affiliated summer schools, workshops, and competitions. We gratefully thank the sponsors of SAT 2019: the SAT Associa- tion, for providing travel support for students attending the conference, Springer and SATALIA, for sponsoring the best paper awards for SAT 2019, the Artificial Intelligence journal, Instituto Superior Técnico, INESC-ID, Turismo de Lisboa, and Conserveira de Lisboa for financial and organizational support for SAT 2019. Thank you. May 2019 Mikoláš Janota Inês Lynce Organization Program Committee Fahiem Bacchus University of Toronto, Canada Olaf Beyersdorff Friedrich Schiller University Jena, Germany Armin Biere Johannes Kepler University Linz, Austria Nikolaj Bjorner Microsoft, USA Maria Luisa Bonet Universitat Politècnica de Catalunya, Spain Sam Buss University of California San Diego, USA Pascal Fontaine Université de Lorraine, CNRS, Inria, LORIA, France Emmanuel Hebrard LAAS, CNRS, France Marijn Heule The University of Texas at Austin, USA Alexey Ignatiev University of Lisbon, Portugal Mikoláš Janota INESC-ID/IST, University of Lisbon, Portugal Jan Johannsen Ludwig Maximilian University of Munich, Germany Matti Järvisalo University of Helsinki, Finland Oliver Kullmann Swansea University, UK Daniel Le Berre CNRS - Université d’Artois, France Inês Lynce INESC-ID/IST, University of Lisbon, Portugal Vasco Manquinho INESC-ID, IST/University of Lisbon, Portugal Felip Manyà IIIA-CSIC, Spain Joao Marques-Silva University of Lisbon, Portugal Ruben Martins Carnegie Mellon University, USA Kuldeep S. Meel National University of Singapore, Singapore Alexander Nadel Intel, Israel Aina Niemetz Stanford University, USA Jakob Nordström KTH Royal Institute of Technology, Sweden Luca Pulina University of Sassari, Italy Markus Rabe Google, USA Roberto Sebastiani University of Trento, Italy Martina Seidl Johannes Kepler University Linz, Austria Natasha Sharygina Università della Svizzera italiana, USI Lugano, Switzerland Laurent Simon Labri, Bordeaux Institute of Technology, France Friedrich Slivovsky Vienna University of Technology, Austria Takehide Soh Kobe University, Japan Martin Suda Czech Technical University, Czech Republic Stefan Szeider Vienna University of Technology, Austria Ralf Wimmer Concept Engineering GmbH and Albert-Ludwigs-Universität Freiburg, Germany Christoph M. Wintersteiger Microsoft, UK viii Organization Additional Reviewers Asadi, Sepideh Lonsing, Florian Blicha, Martin Manthey, Norbert Bliem, Bernhard Marescotti, Matteo Blinkhorn, Joshua Morgado, Antonio Chakraborty, Supratik Möhle, Sibylle Chew, Leroy Nabeshima, Hidetomo Devriendt, Jo Nötzli, Andres Fichte, Johannes K. Papadopoulos, Alexandre Ge-Ernst, Aile Paxian, Tobias Giráldez-Cru, Jesus Peitl, Tomáš Gocht, Stephan Razgon, Igor Hecher, Markus Rebola Pardo, Adrian Hinde, Luke Risse, Kilian Hjort, Håkan Ryvchin, Vadim Hyvarinen, Antti Scheder, Dominik Katsirelos, George Siala, Mohamed Kiesl, Benjamin Sokolov, Dmitry Kokkala, Janne Soos, Mate Koshimura, Miyuki Trentin, Patrick Levy, Jordi Abstracts
The list of books you might like
