Theory and Applications of Satisfiability Testing - SAT 2009

12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings

  • Oliver Kullmann

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Applications of SAT

    1. María Luisa Bonet, Katherine St. John
      Pages 4-17
    2. Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller
      Pages 18-31
    3. Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev
      Pages 32-44
    4. Marko Samer, Helmut Veith
      Pages 45-50
  4. Complexity Theory

    1. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
      Pages 51-64
    2. Olaf Beyersdorff, Sebastian Müller
      Pages 65-72
  5. Structures for SAT

    1. Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal
      Pages 73-79
    2. Daniel Johannsen, Igor Razgon, Magnus Wahlström
      Pages 80-85
    3. Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
      Pages 86-100
    4. Patrick Traxler
      Pages 101-113
  6. Resolution and SAT

  7. Translations to CNF

    1. Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
      Pages 161-166
    2. Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
      Pages 167-180
    3. Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
      Pages 181-194

About these proceedings


This book constitutes the refereed proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, SAT 2009, held in Swansea, UK, in June/July 2009.

The 34 revised full papers presented together with 11 revised short papers and 2 invited talks were carefully selected from 86 submissions. The papers are organized in topical sections on applications of SAT, complexity theory, structures for SAT, resolution and SAT, translations to CNF, techniques for conflict-driven SAT Solvers, solving SAT by local search, hybrid SAT solvers, automatic adaption of SAT solvers, stochastic approaches to SAT solving, QBFs and their representations, optimization algorithms, distributed and parallel solving.


Automat Resolution algorithms circuit based solver complexity complexity theory computational complexity constraint programming default logic distributed algorithms distributed systems exact algorithm heuristics hybrid solving technique

Editors and affiliations

  • Oliver Kullmann
    • 1
  1. 1.Computer Science DepartmentSwansea UniversitySwanseaUK

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02776-5
  • Online ISBN 978-3-642-02777-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book