© 2017

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

About these proceedings


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.


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