Theory and Applications of Satisfiability Testing – SAT 2012

15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings

  • Alessandro Cimatti
  • Roberto Sebastiani

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

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Aaron R. Bradley
      Pages 1-14
  3. Full Papers

    1. Stochastic Local Search

    2. Theory

      1. Friedrich Slivovsky, Stefan Szeider
        Pages 58-71
      2. Serge Gaspers, Stefan Szeider
        Pages 72-85
    3. Quantified Boolean Formulae

      1. Allen Van Gelder, Samuel B. Wood, Florian Lonsing
        Pages 86-99
      2. Mikoláš Janota, William Klieber, Joao Marques-Silva, Edmund Clarke
        Pages 114-128
      3. Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong Roland Jiang
        Pages 129-142
    4. Applications

      1. Vijay Ganesh, Charles W. O’Donnell, Mate Soos, Srinivas Devadas, Martin C. Rinard, Armando Solar-Lezama
        Pages 143-156
      2. Kryštof Hoder, Nikolaj Bjørner
        Pages 157-171
      3. Stefano Ermon, Ronan Le Bras, Carla P. Gomes, Bart Selman, R. Bruce van Dover
        Pages 172-185
      4. Jian Zhang, Feifei Ma, Zhiqiang Zhang
        Pages 186-199
    5. Parallel and Portfolio Approaches

      1. Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
        Pages 200-213
      2. Antti E. J. Hyvärinen, Norbert Manthey
        Pages 214-227
      3. Lin Xu, Frank Hutter, Holger Hoos, Kevin Leyton-Brown
        Pages 228-241
    6. CDCL SAT Solving

      1. Alexander Nadel, Vadim Ryvchin
        Pages 242-255

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012, held in Trento, Italy, in June 2012. The 29 revised full papers, 7 tool papers, and 16 poster papers presented together with 2 invited talks were carefully reviewed and selected from 112 submissions (88 full, 10 tool and 14 poster papers). The papers are organized in topical sections on stochastic local search, theory, quantified Boolean formulae, applications, parallel and portfolio approaches, CDCL SAT solving, MAX-SAT, cores interpolants, complexity analysis, and circuits and encodings.

Keywords

SAT solvers algorithm complexity automated reasoning constraints programming resolution

Editors and affiliations

  • Alessandro Cimatti
    • 1
  • Roberto Sebastiani
    • 2
  1. 1.Center for Information TechnologyFondazione Bruno KesslerTrentoItaly
  2. 2.Department of Information Engineering and Computer ScienceUniversity of TrentoTrentoItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-31612-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31611-1
  • Online ISBN 978-3-642-31612-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book