Advertisement

Theory and Applications of Satisfiability Testing – SAT 2017

20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings

  • Serge Gaspers
  • Toby Walsh
Conference proceedings SAT 2017

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10491)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10491)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Algorithms, Complexity, and Lower Bounds

    1. Front Matter
      Pages 1-1
    2. Dimitris Achlioptas, Panos Theodoropoulos
      Pages 3-19
    3. Robert Ganian, M. S. Ramanujan, Stefan Szeider
      Pages 20-37
    4. Robert Ganian, Stefan Szeider
      Pages 38-52
    5. Dmitry Itsykson, Alexander Knop
      Pages 53-61
  3. Clause Learning and Symmetry Handling

    1. Front Matter
      Pages 63-63
    2. Guillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon
      Pages 65-82
    3. Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe
      Pages 83-100
    4. Tommi Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen
      Pages 101-118
    5. Jia Hui Liang, Hari Govind V.K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh
      Pages 119-135
    6. Hidetomo Nabeshima, Katsumi Inoue
      Pages 136-144
  4. Maximum Satisfiability and Minimal Correction Sets

    1. Front Matter
      Pages 145-145
    2. Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
      Pages 164-183
    3. Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva
      Pages 184-194
    4. Miguel Terra-Neves, Inês Lynce, Vasco Manquinho
      Pages 195-211
  5. Parallel SAT Solving

    1. Front Matter
      Pages 213-213
    2. Gilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary
      Pages 215-232
    3. Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon
      Pages 233-250
    4. Saeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine Gebotys, Pascal Poupart et al.
      Pages 251-260
  6. Quantified Boolean Formulas

    1. Front Matter
      Pages 261-261
    2. Joshua Blinkhorn, Olaf Beyersdorff
      Pages 263-280
    3. Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl
      Pages 281-297
    4. Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
      Pages 298-313
    5. Markus N. Rabe
      Pages 314-325
    6. Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker
      Pages 326-343
  7. Satisfiability Modulo Theories

    1. Front Matter
      Pages 345-345
    2. Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina
      Pages 347-363
    3. Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey
      Pages 380-397
  8. SAT Encodings

    1. Front Matter
      Pages 399-399
    2. Johannes K. Fichte, Neha Lodha, Stefan Szeider
      Pages 401-411
    3. Petr Kučera, Petr Savický, Vojtěch Vorel
      Pages 412-428
    4. Neha Lodha, Sebastian Ordyniak, Stefan Szeider
      Pages 429-445
  9. Tool Papers

    1. Front Matter
      Pages 447-447
    2. Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo
      Pages 449-456
    3. Peter Lammich
      Pages 457-463
    4. Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals
      Pages 464-473
  10. Back Matter
    Pages 475-476

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017.

The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.

Keywords

artificial intelligence computer architecture computer software selection and evaluation constraint theory formal logic formal methods formal verifications genetic algorithms learning algorithms learning systems machine learning model checking problem solving program processors sat solvers satisfiability semantics software engineering theorem proving verification

Editors and affiliations

  1. 1.UNSW SydneySydneyAustralia
  2. 2.University of New South Wales SydneyAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-66263-3
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-66262-6
  • Online ISBN 978-3-319-66263-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site