Theory and Applications of Satisfiability Testing – SAT 2010

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference
3. Altmetric Badge
   Chapter 2 Exact Algorithms and Complexity
4. Altmetric Badge
   Chapter 3 Improving Stochastic Local Search for SAT with a New Probability Distribution
5. Altmetric Badge
   Chapter 4 Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
6. Altmetric Badge
   Chapter 5 Proof Complexity of Propositional Default Logic
7. Altmetric Badge
   Chapter 6 Automated Testing and Debugging of SAT and QBF Solvers
8. Altmetric Badge
   Chapter 7 Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
9. Altmetric Badge
   Chapter 8 Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
10. Altmetric Badge
    Chapter 9 sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
11. Altmetric Badge
    Chapter 10 Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
12. Altmetric Badge
    Chapter 11 Symmetry and Satisfiability: An Update
13. Altmetric Badge
    Chapter 12 A Non-prenex, Non-clausal QBF Solver with Game-State Learning
14. Altmetric Badge
    Chapter 13 SAT Solving with Reference Points
15. Altmetric Badge
    Chapter 14 Integrating Dependency Schemes in Search-Based QBF Solvers
16. Altmetric Badge
    Chapter 15 An Exact Algorithm for the Boolean Connectivity Problem for k-CNF
17. Altmetric Badge
    Chapter 16 Improving Unsatisfiability-Based Algorithms for Boolean Optimization
18. Altmetric Badge
    Chapter 17 Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs
19. Altmetric Badge
    Chapter 18 Statistical Methodology for Comparison of SAT Solvers
20. Altmetric Badge
    Chapter 19 On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
21. Altmetric Badge
    Chapter 20 The Seventh QBF Solvers Evaluation (QBFEVAL’10)
22. Altmetric Badge
    Chapter 21 Complexity Results for Linear XSAT-Problems
23. Altmetric Badge
    Chapter 22 Bounds on Threshold of Regular Random k-SAT
24. Altmetric Badge
    Chapter 23 Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
25. Altmetric Badge
    Chapter 24 Improved Local Search for Circuit Satisfiability
26. Altmetric Badge
    Chapter 25 A System for Solving Constraint Satisfaction Problems with SMT
27. Altmetric Badge
    Chapter 26 Two Techniques for Minimizing Resolution Proofs
28. Altmetric Badge
    Chapter 27 On Moderately Exponential Time for SAT
29. Altmetric Badge
    Chapter 28 Minimising Deterministic Büchi Automata Precisely Using SAT Solving
30. Altmetric Badge
    Chapter 29 Exploiting Circuit Representations in QBF Solving
31. Altmetric Badge
    Chapter 30 Reconstructing Solutions after Blocked Clause Elimination
32. Altmetric Badge
    Chapter 31 An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
33. Altmetric Badge
    Chapter 32 Exact Ramsey Theory: Green-Tao numbers and SAT
34. Altmetric Badge
    Chapter 33 Exact MinSAT Solving
35. Altmetric Badge
    Chapter 34 Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable
36. Altmetric Badge
    Chapter 35 Assignment Stack Shrinking
37. Altmetric Badge
    Chapter 36 Simple but Hard Mixed Horn Formulas
38. Altmetric Badge
    Chapter 37 Zero-One Designs Produce Small Hard SAT Instances