Theory and Applications of Satisfiability Testing

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Satisfiability and Computing van der Waerden Numbers
3. Altmetric Badge
   Chapter 2 An Algorithm for SAT Above the Threshold
4. Altmetric Badge
   Chapter 3 Watched Data Structures for QBF Solvers
5. Altmetric Badge
   Chapter 4 How Good Can a Resolution Based SAT-solver Be?
6. Altmetric Badge
   Chapter 5 A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation
7. Altmetric Badge
   Chapter 6 Density Condensation of Boolean Formulas
8. Altmetric Badge
   Chapter 7 SAT Based Predicate Abstraction for Hardware Verification
9. Altmetric Badge
   Chapter 8 On Boolean Models for Quantified Boolean Horn Formulas
10. Altmetric Badge
    Chapter 9 Local Search on SAT-encoded Colouring Problems
11. Altmetric Badge
    Chapter 10 A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods
12. Altmetric Badge
    Chapter 11 Hidden Threshold Phenomena for Fixed-Density SAT-formulae
13. Altmetric Badge
    Chapter 12 Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs
14. Altmetric Badge
    Chapter 13 Width-Based Algorithms for SAT and CIRCUIT-SAT
15. Altmetric Badge
    Chapter 14 Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems
16. Altmetric Badge
    Chapter 15 On Fixed-Parameter Tractable Parameterizations of SAT
17. Altmetric Badge
    Chapter 16 On the Probabilistic Approach to the Random Satisfiability Problem
18. Altmetric Badge
    Chapter 17 Comparing Different Prenexing Strategies for Quantified Boolean Formulas
19. Altmetric Badge
    Chapter 18 Solving Error Correction for Large Data Sets by Means of a SAT Solver
20. Altmetric Badge
    Chapter 19 Using Problem Structure for Efficient Clause Learning
21. Altmetric Badge
    Chapter 20 Abstraction-Driven SAT-based Analysis of Security Protocols
22. Altmetric Badge
    Chapter 21 A Case for Efficient Solution Enumeration
23. Altmetric Badge
    Chapter 22 Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms
24. Altmetric Badge
    Chapter 23 Local Consistencies in SAT
25. Altmetric Badge
    Chapter 24 Guiding SAT Diagnosis with Tree Decompositions
26. Altmetric Badge
    Chapter 25 On Computing k -CNF Formula Properties
27. Altmetric Badge
    Chapter 26 Effective Preprocessing with Hyper-Resolution and Equality Reduction
28. Altmetric Badge
    Chapter 27 Read-Once Unit Resolution
29. Altmetric Badge
    Chapter 28 The Interaction Between Inference and Branching Heuristics
30. Altmetric Badge
    Chapter 29 Hypergraph Reductions and Satisfiability Problems
31. Altmetric Badge
    Chapter 30 SBSAT: a State-Based, BDD-Based Satisfiability Solver
32. Altmetric Badge
    Chapter 31 Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution
33. Altmetric Badge
    Chapter 32 The Combinatorics of Conflicts between Clauses
34. Altmetric Badge
    Chapter 33 Conflict-Based Selection of Branching Rules
35. Altmetric Badge
    Chapter 34 The Essentials of the SAT 2003 Competition
36. Altmetric Badge
    Chapter 35 Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers
37. Altmetric Badge
    Chapter 36 kcnfs : An Efficient Solver for Random k -SAT Formulae
38. Altmetric Badge
    Chapter 37 An Extensible SAT-solver
39. Altmetric Badge
    Chapter 38 Survey and Belief Propagation on Random K -SAT