Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Satisfiability Testing -- SAT 2012

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Alessandro Cimatti

    1. Center for Information Technology, Fondazione Bruno Kessler, Trento, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Roberto Sebastiani

    1. Department of Information Engineering and Computer Science, University of Trento, Trento, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SAT 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (54 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Understanding IC3

      • Aaron R. Bradley
      Pages 1-14

    2. Satisfiability and The Art of Computer Programming

      • Donald Knuth
      Pages 15-15

  3. Full Papers

    1. Stochastic Local Search

      1. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
        • Adrian Balint, Uwe Schöning
        Pages 16-29
      2. Off the Trail: Re-examining the CDCL Algorithm
        • Alexandra Goultiaeva, Fahiem Bacchus
        Pages 30-43

    2. Theory

      1. An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
        • Maria Luisa Bonet, Sam Buss
        Pages 44-57
      2. Computing Resolution-Path Dependencies in Linear Time ,
        • Friedrich Slivovsky, Stefan Szeider
        Pages 58-71
      3. Strong Backdoors to Nested Satisfiability
        • Serge Gaspers, Stefan Szeider
        Pages 72-85

    3. Quantified Boolean Formulae

      1. Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
        • Allen Van Gelder, Samuel B. Wood, Florian Lonsing
        Pages 86-99
      2. On Sequent Systems and Resolution for QBFs
        • Uwe Egly
        Pages 100-113
      3. Solving QBF with Counterexample Guided Refinement
        • Mikoláš Janota, William Klieber, Joao Marques-Silva, Edmund Clarke
        Pages 114-128
      4. Henkin Quantifiers and Boolean Formulae
        • Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong Roland Jiang
        Pages 129-142

    4. Applications

      1. Lynx: A Programmatic SAT Solver for the RNA-Folding Problem
        • Vijay Ganesh, Charles W. O’Donnell, Mate Soos, Srinivas Devadas, Martin C. Rinard, Armando Solar-Lezama
        Pages 143-156
      2. Generalized Property Directed Reachability
        • KryÅ¡tof Hoder, Nikolaj Bjørner
        Pages 157-171
      3. SMT-Aided Combinatorial Materials Discovery
        • Stefano Ermon, Ronan Le Bras, Carla P. Gomes, Bart Selman, R. Bruce van Dover
        Pages 172-185
      4. Faulty Interaction Identification via Constraint Solving and Optimization
        • Jian Zhang, Feifei Ma, Zhiqiang Zhang
        Pages 186-199

    5. Parallel and Portfolio Approaches

      1. Revisiting Clause Exchange in Parallel SAT Solving
        • Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez, Cédric Piette
        Pages 200-213
      2. Designing Scalable Parallel SAT Solvers
        • Antti E. J. Hyvärinen, Norbert Manthey
        Pages 214-227
      3. Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors
        • Lin Xu, Frank Hutter, Holger Hoos, Kevin Leyton-Brown
        Pages 228-241

    6. CDCL SAT Solving

      1. Efficient SAT Solving under Assumptions
        • Alexander Nadel, Vadim Ryvchin
        Pages 242-255
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2012

Keywords

About this book

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.

Editors and Affiliations

  • Center for Information Technology, Fondazione Bruno Kessler, Trento, Italy

    Alessandro Cimatti

  • Department of Information Engineering and Computer Science, University of Trento, Trento, Italy

    Roberto Sebastiani

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation