Theory and Applications of Satisfiability Testing -- SAT 2015

18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings

  • Marijn Heule
  • Sean Weaver

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

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

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Valeriy Balabanov, Alexander Ivrii
    Pages 17-32
  3. Ruiwen Chen, Rahul Santhanam
    Pages 33-45
  4. Jan Burchard, Tobias Schubert, Bernd Becker
    Pages 46-61
  5. Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, Krzysztof Czarnecki
    Pages 62-70
  6. Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz
    Pages 71-87
  7. Alexander Ivrii, Vadim Ryvchin, Ofer Strichman
    Pages 88-103
  8. Adam Douglass, Andrew D. King, Jack Raymond
    Pages 104-120 Open Access
  9. Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
    Pages 121-137
  10. Oliver Kullmann, João Marques-Silva
    Pages 138-155
  11. Tomáš Balyo, Peter Sanders, Carsten Sinz
    Pages 156-172
  12. Ralf Wimmer, Karina Gitina, Jennifer Nist, Christoph Scholl, Bernd Becker
    Pages 173-190
  13. Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
    Pages 199-214
  14. Stefan Falkner, Marius Lindauer, Frank Hutter
    Pages 215-222
  15. Robert Ganian, Stefan Szeider
    Pages 223-237
  16. Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy, Laurent Simon
    Pages 238-254
  17. Markus Iser, Norbert Manthey, Carsten Sinz
    Pages 255-271

About these proceedings


This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (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, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation.
The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at


Analysis of algorithms Boolean optimization Combinatorial theory of satisfiability Computational complexity Constraint programming Exact and parameterized algorithms Formal methods Logic MaxSAT Proof complexity Proof systems Propositional satisfiability problem Quantified boolean formulas QBF Random instances SAT SAT solvers Satisfiability modulo theories Search algorithms and heuristics SMT

Editors and affiliations

  • Marijn Heule
    • 1
  • Sean Weaver
    • 2
  1. 1.AlgorithmsUniversity of TexasAustinUSA
  2. 2.Trusted Systems Research GroupFort MeadeUSA

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-24317-7
  • Online ISBN 978-3-319-24318-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book