Theory and Applications of Satisfiability Testing

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Solving Over-Constrained Problems with SAT Technology
3. Altmetric Badge
   Chapter 2 A Symbolic Search Based Approach for Quantified Boolean Formulas
4. Altmetric Badge
   Chapter 3 Substitutional Definition of Satisfiability in Classical Propositional Logic
5. Altmetric Badge
   Chapter 4 A Clause-Based Heuristic for SAT Solvers
6. Altmetric Badge
   Chapter 5 Effective Preprocessing in SAT Through Variable and Clause Elimination
7. Altmetric Badge
   Chapter 6 Resolution and Pebbling Games
8. Altmetric Badge
   Chapter 7 Local and Global Complete Solution Learning Methods for QBF
9. Altmetric Badge
   Chapter 8 Equivalence Checking of Circuits with Parameterized Specifications
10. Altmetric Badge
    Chapter 9 Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
11. Altmetric Badge
    Chapter 10 Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution
12. Altmetric Badge
    Chapter 11 Resolution Tunnels for Improved SAT Solver Performance
13. Altmetric Badge
    Chapter 12 Diversification and Determinism in Local Search for Satisfiability
14. Altmetric Badge
    Chapter 13 On Finding All Minimally Unsatisfiable Subformulas
15. Altmetric Badge
    Chapter 14 Optimizations for Compiling Declarative Models into Boolean Formulas
16. Altmetric Badge
    Chapter 15 Random Walk with Continuously Smoothed Variable Weights
17. Altmetric Badge
    Chapter 16 Derandomization of PPSZ for Unique- k -SAT
18. Altmetric Badge
    Chapter 17 Heuristics for Fast Exact Model Counting
19. Altmetric Badge
    Chapter 18 A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
20. Altmetric Badge
    Chapter 19 DPvis – A Tool to Visualize the Structure of SAT Instances
21. Altmetric Badge
    Chapter 20 Constraint Metrics for Local Search
22. Altmetric Badge
    Chapter 21 Input Distance and Lower Bounds for Propositional Resolution Proof Length
23. Altmetric Badge
    Chapter 22 Sums of Squares, Satisfiability and Maximum Satisfiability
24. Altmetric Badge
    Chapter 23 Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable
25. Altmetric Badge
    Chapter 24 A New Approach to Model Counting
26. Altmetric Badge
    Chapter 25 Benchmarking SAT Solvers for Bounded Model Checking
27. Altmetric Badge
    Chapter 26 Model-Equivalent Reductions
28. Altmetric Badge
    Chapter 27 Improved Exact Solvers for Weighted Max-SAT
29. Altmetric Badge
    Chapter 28 Quantifier Trees for QBFs
30. Altmetric Badge
    Chapter 29 Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
31. Altmetric Badge
    Chapter 30 A Branching Heuristics for Quantified Renamable Horn Formulas
32. Altmetric Badge
    Chapter 31 An Improved Upper Bound for SAT
33. Altmetric Badge
    Chapter 32 Bounded Model Checking with QBF
34. Altmetric Badge
    Chapter 33 Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies
35. Altmetric Badge
    Chapter 34 Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas
36. Altmetric Badge
    Chapter 35 Automated Generation of Simplification Rules for SAT and MAXSAT
37. Altmetric Badge
    Chapter 36 Speedup Techniques Utilized in Modern SAT Solvers
38. Altmetric Badge
    Chapter 37 FPGA Logic Synthesis Using Quantified Boolean Satisfiability
39. Altmetric Badge
    Chapter 38 On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
40. Altmetric Badge
    Chapter 39 A New Set of Algebraic Benchmark Problems for SAT Solvers
41. Altmetric Badge
    Chapter 40 A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
42. Altmetric Badge
    Chapter 41 Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
43. Altmetric Badge
    Chapter 42 On Subsumption Removal and On-the-Fly CNF Simplification