Theory and Applications of Satisfiability Testing - SAT 2006

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 From Propositional Satisfiability to Satisfiability Modulo Theories
3. Altmetric Badge
   Chapter 2 CSPs: Adding Structure to SAT
4. Altmetric Badge
   Chapter 3 Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
5. Altmetric Badge
   Chapter 4 Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
6. Altmetric Badge
   Chapter 5 A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
7. Altmetric Badge
   Chapter 6 Minimum Witnesses for Unsatisfiable 2CNFs
8. Altmetric Badge
   Chapter 7 Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
9. Altmetric Badge
   Chapter 8 Extended Resolution Proofs for Symbolic SAT Solving with Quantification
10. Altmetric Badge
    Chapter 9 Encoding CNFs to Empower Component Analysis
11. Altmetric Badge
    Chapter 10 Satisfiability Checking of Non-clausal Formulas Using General Matings
12. Altmetric Badge
    Chapter 11 Determinization of Resolution by an Algorithm Operating on Complete Assignments
13. Altmetric Badge
    Chapter 12 A Complete Random Jump Strategy with Guiding Paths
14. Altmetric Badge
    Chapter 13 Applications of SAT Solvers to Cryptanalysis of Hash Functions
15. Altmetric Badge
    Chapter 14 Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies
16. Altmetric Badge
    Chapter 15 Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
17. Altmetric Badge
    Chapter 16 SAT in Bioinformatics: Making the Case with Haplotype Inference
18. Altmetric Badge
    Chapter 17 Lemma Learning in SMT on Linear Constraints
19. Altmetric Badge
    Chapter 18 On SAT Modulo Theories and Optimization Problems
20. Altmetric Badge
    Chapter 19 Fast and Flexible Difference Constraint Propagation for DPLL(T)
21. Altmetric Badge
    Chapter 20 A Progressive Simplifier for Satisfiability Modulo Theories
22. Altmetric Badge
    Chapter 21 Dependency Quantified Horn Formulas: Models and Complexity
23. Altmetric Badge
    Chapter 22 On Linear CNF Formulas
24. Altmetric Badge
    Chapter 23 A Dichotomy Theorem for Typed Constraint Satisfaction Problems
25. Altmetric Badge
    Chapter 24 A Complete Calculus for Max-SAT
26. Altmetric Badge
    Chapter 25 On Solving the Partial MAX-SAT Problem
27. Altmetric Badge
    Chapter 26 MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
28. Altmetric Badge
    Chapter 27 Average-Case Analysis for the MAX-2SAT Problem
29. Altmetric Badge
    Chapter 28 Local Search for Unsatisfiability
30. Altmetric Badge
    Chapter 29 Efficiency of Local Search
31. Altmetric Badge
    Chapter 30 Implementing Survey Propagation on Graphics Processing Units
32. Altmetric Badge
    Chapter 31 Characterizing Propagation Methods for Boolean Satisfiability
33. Altmetric Badge
    Chapter 32 Minimal False Quantified Boolean Formulas
34. Altmetric Badge
    Chapter 33 Binary Clause Reasoning in QBF
35. Altmetric Badge
    Chapter 34 Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
36. Altmetric Badge
    Chapter 35 QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
37. Altmetric Badge
    Chapter 36 Solving #SAT Using Vertex Covers
38. Altmetric Badge
    Chapter 37 Counting Models in Integer Domains
39. Altmetric Badge
    Chapter 38 sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP
40. Altmetric Badge
    Chapter 39 A Distribution Method for Solving SAT in Grids