Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Satisfiability Testing - SAT 2006

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Armin Biere

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Carla P. Gomes

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: SAT 2006.

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 (39 papers)

  1. Front Matter

    Download chapter PDF

  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. Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel

      • Oliver Kullmann, Inês Lynce, João Marques-Silva
      Pages 22-35

    3. A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

      • Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
      Pages 36-41

    4. Minimum Witnesses for Unsatisfiable 2CNFs

      • Joshua Buresh-Oppenheim, David Mitchell
      Pages 42-47

    5. Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs

      • Allen Van Gelder
      Pages 48-53

    6. 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

    3. Determinization of Resolution by an Algorithm Operating on Complete Assignments

      • Eugene Goldberg
      Pages 90-95

    4. A Complete Random Jump Strategy with Guiding Paths

      • Hantao Zhang
      Pages 96-101

  5. Session 3. Applications

    1. Applications of SAT Solvers to Cryptanalysis of Hash Functions

      • Ilya Mironov, Lintao Zhang
      Pages 102-115

    2. Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies

      • Yuliya Zabiyaka, Adnan Darwiche
      Pages 116-129

    3. Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/\(\mathcal{ALC}\)

      • Roberto Sebastiani, Michele Vescovi
      Pages 130-135

    4. 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

    3. Fast and Flexible Difference Constraint Propagation for DPLL(T)

      • Scott Cotton, Oded Maler
      Pages 170-183
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing - SAT 2006

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation