Skip to main content
  • Conference proceedings
  • © 2006

Theory and Applications of Satisfiability Testing - SAT 2006

9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings

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

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

Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing

Conference proceedings info: SAT 2006.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (39 papers)

  1. Front Matter

  2. Invited Talks

    1. From Propositional Satisfiability to Satisfiability Modulo Theories

      • Hossein M. Sheini, Karem A. Sakallah
      Pages 1-9
    2. CSPs: Adding Structure to SAT

      • Fahiem Bacchus
      Pages 10-10
  3. Session 1. Proofs and Cores

    1. Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

      • Arist Kojevnikov, Alexander S. Kulikov
      Pages 11-21
    2. A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

      • Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
      Pages 36-41
    3. Minimum Witnesses for Unsatisfiable 2CNFs

      • Joshua Buresh-Oppenheim, David Mitchell
      Pages 42-47
    4. Extended Resolution Proofs for Symbolic SAT Solving with Quantification

      • Toni Jussila, Carsten Sinz, Armin Biere
      Pages 54-60
  4. Session 2. Heuristics and Algorithms

    1. Encoding CNFs to Empower Component Analysis

      • Mark Chavira, Adnan Darwiche
      Pages 61-74
    2. Satisfiability Checking of Non-clausal Formulas Using General Matings

      • Himanshu Jain, Constantinos Bartzis, Edmund Clarke
      Pages 75-89
  5. Session 3. Applications

    1. Applications of SAT Solvers to Cryptanalysis of Hash Functions

      • Ilya Mironov, Lintao Zhang
      Pages 102-115
    2. SAT in Bioinformatics: Making the Case with Haplotype Inference

      • Inês Lynce, João Marques-Silva
      Pages 136-141
  6. Session 4. SMT

    1. Lemma Learning in SMT on Linear Constraints

      • Yinlei Yu, Sharad Malik
      Pages 142-155
    2. On SAT Modulo Theories and Optimization Problems

      • Robert Nieuwenhuis, Albert Oliveras
      Pages 156-169

Other Volumes

  1. Theory and Applications of Satisfiability Testing - SAT 2006

Keywords

  • QBF
  • SAT solvers
  • SMT
  • algorithms
  • bioinformatics
  • calculus
  • complexity
  • description logics
  • heuristics
  • learning
  • local search
  • optimization
  • random walks
  • resolution
  • satisfiability testing
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria

    Armin Biere

  • Department of Computer Science, Cornell University, Ithaca, U.S.A.

    Carla P. Gomes

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions