Advertisement

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
      2. Alexander Nadel, Vadim Ryvchin, Ofer Strichman
        Pages 256-269
    7. MAX-SAT, Cores Interpolants

      1. Oliver Kullmann, Xishun Zhao
        Pages 270-283
      2. Antonio Morgado, Federico Heras, Joao Marques-Silva
        Pages 284-297
      3. Anton Belov, Alexander Ivrii, Arie Matsliah, Joao Marques-Silva
        Pages 298-311
      4. Georg Weissenbacher
        Pages 312-326
    8. Complexity Analysis

      1. Dimitris Achlioptas, Ricardo Menchaca-Mendez
        Pages 327-340
      2. Nadia Creignou, Heribert Vollmer
        Pages 341-354
      3. Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
        Pages 355-368
    9. Circuits and Encodings

      1. Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
        Pages 369-382
      2. Tero Laitinen, Tommi Junttila, Ilkka Niemelä
        Pages 383-396
      3. Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah
        Pages 397-409
      4. Carlos Ansótegui, Jesús Giráldez-Cru, Jordi Levy
        Pages 410-423
    10. Tool Presentations

      1. Thomas Hugel
        Pages 424-429
      2. Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere
        Pages 430-435
      3. Norbert Manthey
        Pages 436-441
      4. Florian Corzilius, Ulrich Loup, Sebastian Junges, Erika Ábrahám
        Pages 442-448
      5. Stephan Kottler, Christian Zielke, Paul Seitz, Michael Kaufmann
        Pages 449-455
      6. Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara
        Pages 456-462
      7. Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay Saraswat
        Pages 463-468
    11. Poster Presentations

      1. Sebastian Burg, Stephan Kottler, Michael Kaufmann
        Pages 471-472
      2. Paolo Marin, Christian Miller, Bernd Becker
        Pages 473-474
      3. Peter van der Tak, Marijn J. H. Heule, Armin Biere
        Pages 475-476
      4. Alejandro Arbelaez, Philippe Codognet
        Pages 481-482
      5. Markus Iser, Mana Taghdiri, Carsten Sinz
        Pages 483-484
      6. Mark H. Liffiton, Jordyn C. Maglalang
        Pages 485-486
      7. Sam Bayless, Alan J. Hu
        Pages 487-488

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
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Aerospace