↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2012

Overview of attention for book
Cover of 'Theory and Applications of Satisfiability Testing – SAT 2012'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Understanding IC3
  3. Altmetric Badge
    Chapter 2 Satisfiability and The Art of Computer Programming
  4. Altmetric Badge
    Chapter 3 Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
  5. Altmetric Badge
    Chapter 4 Off the Trail: Re-examining the CDCL Algorithm
  6. Altmetric Badge
    Chapter 5 An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
  7. Altmetric Badge
    Chapter 6 Computing Resolution-Path Dependencies in Linear Time ,
  8. Altmetric Badge
    Chapter 7 Strong Backdoors to Nested Satisfiability
  9. Altmetric Badge
    Chapter 8 Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
  10. Altmetric Badge
    Chapter 9 Theory and Applications of Satisfiability Testing – SAT 2012
  11. Altmetric Badge
    Chapter 10 Solving QBF with Counterexample Guided Refinement
  12. Altmetric Badge
    Chapter 11 Theory and Applications of Satisfiability Testing – SAT 2012
  13. Altmetric Badge
    Chapter 12 Lynx: A Programmatic SAT Solver for the RNA-Folding Problem
  14. Altmetric Badge
    Chapter 13 Generalized Property Directed Reachability
  15. Altmetric Badge
    Chapter 14 SMT-Aided Combinatorial Materials Discovery
  16. Altmetric Badge
    Chapter 15 Faulty Interaction Identification via Constraint Solving and Optimization
  17. Altmetric Badge
    Chapter 16 Revisiting Clause Exchange in Parallel SAT Solving
  18. Altmetric Badge
    Chapter 17 Designing Scalable Parallel SAT Solvers
  19. Altmetric Badge
    Chapter 18 Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors
  20. Altmetric Badge
    Chapter 19 Efficient SAT Solving under Assumptions
  21. Altmetric Badge
    Chapter 20 Preprocessing in Incremental SAT
  22. Altmetric Badge
    Chapter 21 On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
  23. Altmetric Badge
    Chapter 22 Improvements to Core-Guided Binary Search for MaxSAT
  24. Altmetric Badge
    Chapter 23 On Efficient Computation of Variable MUSes
  25. Altmetric Badge
    Chapter 24 Interpolant Strength Revisited
  26. Altmetric Badge
    Chapter 25 Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas
  27. Altmetric Badge
    Chapter 26 Parameterized Complexity of Weighted Satisfiability Problems
  28. Altmetric Badge
    Chapter 27 Fixed-Parameter Tractability of Satisfying beyond the Number of Variables
  29. Altmetric Badge
    Chapter 28 Finding Efficient Circuits for Ensemble Computation
  30. Altmetric Badge
    Chapter 29 Conflict-Driven XOR-Clause Learning
  31. Altmetric Badge
    Chapter 30 Perfect Hashing and CNF Encodings of Cardinality Constraints
  32. Altmetric Badge
    Chapter 31 The Community Structure of SAT Formulas
  33. Altmetric Badge
    Chapter 32 SATLab: X-Raying Random k-SAT
  34. Altmetric Badge
    Chapter 33 Theory and Applications of Satisfiability Testing – SAT 2012
  35. Altmetric Badge
    Chapter 34 Coprocessor 2.0 – A Flexible CNF Simplifier
  36. Altmetric Badge
    Chapter 35 SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox
  37. Altmetric Badge
    Chapter 36 CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers
  38. Altmetric Badge
    Chapter 37 Azucar: A SAT-Based CSP Solver Using Compact Order Encoding
  39. Altmetric Badge
    Chapter 38 SatX10: A Scalable Plug&Play Parallel SAT Framework
  40. Altmetric Badge
    Chapter 39 Improved Single Pass Algorithms for Resolution Proof Reduction
  41. Altmetric Badge
    Chapter 40 Creating Industrial-Like SAT Instances by Clustering and Reconstruction
  42. Altmetric Badge
    Chapter 41 Incremental QBF Preprocessing for Partial Design Verification
  43. Altmetric Badge
    Chapter 42 Theory and Applications of Satisfiability Testing – SAT 2012
  44. Altmetric Badge
    Chapter 43 Satisfying versus Falsifying in Local Search for Satisfiability
  45. Altmetric Badge
    Chapter 44 Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability
  46. Altmetric Badge
    Chapter 45 Towards Massively Parallel Local Search for SAT
  47. Altmetric Badge
    Chapter 46 Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod
  48. Altmetric Badge
    Chapter 47 A Cardinality Solver: More Expressive Constraints for Free
  49. Altmetric Badge
    Chapter 48 Single-Solver Algorithms for 2QBF
  50. Altmetric Badge
    Chapter 49 An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition
  51. Altmetric Badge
    Chapter 50 Intensification Search in Modern SAT Solvers
  52. Altmetric Badge
    Chapter 51 Using Term Rewriting to Solve Bit-Vector Arithmetic Problems
  53. Altmetric Badge
    Chapter 52 Learning Polynomials over GF(2) in a SAT Solver
  54. Altmetric Badge
    Chapter 53 Learning Back-Clauses in SAT
  55. Altmetric Badge
    Chapter 54 Augmenting Clause Learning with Implied Literals
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
7 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Theory and Applications of Satisfiability Testing – SAT 2012
Published by
Springer Berlin Heidelberg, January 2012
DOI 10.1007/978-3-642-31612-8
ISBNs
978-3-64-231611-1, 978-3-64-231612-8
Editors

Alessandro Cimatti, Roberto Sebastiani

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 57%
Other 1 14%
Student > Bachelor 1 14%
Unknown 1 14%
Readers by discipline Count As %
Computer Science 5 71%
Medicine and Dentistry 1 14%
Unknown 1 14%