Advertisement

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
    4. Hyondeuk Kim, Fabio Somenzi, HoonSang Jin
      Pages 195-208
  8. Techniques for Conflict-Driven SAT Solvers

    1. Hyojung Han, Fabio Somenzi
      Pages 209-222
    2. Bas Schaafsma, Marijn J. H. Heule, Hans van Maaren
      Pages 223-236
    3. Niklas Sörensson, Armin Biere
      Pages 237-243
    4. Mate Soos, Karsten Nohl, Claude Castelluccia
      Pages 244-257
  9. Solving SAT by Local Search

  10. Hybrid SAT Solvers

  11. Automatic Adaption of SAT Solvers

    1. Mladen Nikolić, Filip Marić, Predrag Janičić
      Pages 326-340
    2. Knot Pipatsrisawat, Adnan Darwiche
      Pages 341-355
    3. Carsten Sinz, Markus Iser
      Pages 356-362
  12. Stochastic Approaches to SAT Solving

    1. Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
      Pages 363-376
  13. QBFs and Their Representations

    1. Hans Kleine Büning, Xishun Zhao, Uwe Bubeck
      Pages 391-397
    2. Florian Lonsing, Armin Biere
      Pages 398-411
    3. Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus
      Pages 412-426
  14. Optimisation Algorithms

    1. Carlos Ansótegui, María Luisa Bonet, Jordi Levy
      Pages 427-440
    2. Timo Berthold, Stefan Heinz, Marc E. Pfetsch
      Pages 441-446
    3. Lukas Kroc, Ashish Sabharwal, Bart Selman
      Pages 447-452
    4. Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
      Pages 453-466
    5. Chu Min Li, Felip Manyà, Nouredine Mohamedou, Jordi Planes
      Pages 467-480
    6. Mark H. Liffiton, Karem A. Sakallah
      Pages 481-494
    7. Vasco Manquinho, Joao Marques-Silva, Jordi Planes
      Pages 495-508
  15. Distributed and Parallel Solving

    1. Matthew Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia
      Pages 509-523
    2. Kei Ohmura, Kazunori Ueda
      Pages 524-537
  16. Back Matter

About these proceedings

Introduction

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.

Keywords

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 https://doi.org/10.1007/978-3-642-02777-2
  • 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
  • Buy this book on publisher's site