© 2018

Theory and Applications of Satisfiability Testing – SAT 2018

21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings

  • Olaf Beyersdorff
  • Christoph M. Wintersteiger
Conference proceedings SAT 2018

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

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

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Invited Talk

    1. Front Matter
      Pages 1-1
  3. Maximum Satisfiability

    1. Front Matter
      Pages 17-17
    2. Rüdiger Ehlers, Francisco Palau Romero
      Pages 19-36
    3. Tobias Paxian, Sven Reimer, Bernd Becker
      Pages 37-53
    4. Alexander Nadel
      Pages 54-72
  4. Conflict Driven Clause Learning

    1. Front Matter
      Pages 73-73
    2. Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals
      Pages 75-93
    3. Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh
      Pages 94-110
    4. Alexander Nadel, Vadim Ryvchin
      Pages 111-121
    5. Sima Jamali, David Mitchell
      Pages 122-131
  5. Model Counting

    1. Front Matter
      Pages 133-133
    2. Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos
      Pages 135-147
    3. Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos
      Pages 148-164
    4. Johannes K. Fichte, Markus Hecher, Michael Morak, Stefan Woltran
      Pages 165-184
  6. Quantified Boolean Formulae

    1. Front Matter
      Pages 185-185
    2. Mikoláš Janota
      Pages 187-198
    3. Manuel Kauers, Martina Seidl
      Pages 199-216
    4. Martin Suda, Bernhard Gleiss
      Pages 217-234

About these proceedings


This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018.

The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (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 as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.


artificial intelligence competition computer architecture computer programming formal logic formal verification graph theory model checking probability problem solving programming languages sat solvers satisfiability semantics software engineering software evaluation theorem proving verification

Editors and affiliations

  1. 1.Friedrich Schiller University JenaJenaGermany
  2. 2.Microsoft Research Ltd.CambridgeUnited Kingdom

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking