© 2011

Theory and Applications of Satisfiability Testing - SAT 2011

14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings

  • Karem A. Sakallah
  • Laurent Simon
Conference proceedings SAT 2011

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Technical Program

    1. Session 1: Complexity Analysis

      1. Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
        Pages 5-18
      2. Evgeny Dantsin, Edward A. Hirsch
        Pages 19-32
      3. Oliver Kullmann, Xishun Zhao
        Pages 33-46
      4. Sebastian Ordyniak, Daniel Paulusma, Stefan Szeider
        Pages 47-60
    2. Session 2: Binary Decision Diagrams

      1. Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
        Pages 61-75
    3. Session 3: Theoretical Analysis

      1. Nadia Creignou, Frédéric Olive, Johannes Schmidt
        Pages 120-133
      2. Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen
        Pages 134-144
    4. Session 4: Extraction of Minimal Unsatisfiable Subsets

      1. Anton Belov, Joao Marques-Silva
        Pages 145-158
      2. Joao Marques-Silva, Ines Lynce
        Pages 159-173
      3. Vadim Ryvchin, Ofer Strichman
        Pages 174-187
    5. Session 5: SAT Algorithms

      1. Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Saïs
        Pages 188-200
      2. Marijn J. H. Heule, Matti Järvisalo, Armin Biere
        Pages 201-215
      3. Antonio Ramos, Peter van der Tak, Marijn J. H. Heule
        Pages 216-229
    6. Session 6: Quantified Boolean Formulae

      1. Mikoláš Janota, Joao Marques-Silva
        Pages 230-244

About these proceedings


This book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011.

The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.


SAT SAT solvers abstraction complexity theory constraint satisfaction constraint solving normal form transformation

Editors and affiliations

  • Karem A. Sakallah
    • 1
  • Laurent Simon
    • 2
  1. 1.University of MichiganAnn ArborUSA
  2. 2.LRI / CNRS UMR8623 / INRIA SaclayUniv Paris-SudOrsayFrance

Bibliographic information