↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2013

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs
  3. Altmetric Badge
    Chapter 2 Turing’s Computable Real Numbers and Why They Are Still Important Today
  4. Altmetric Badge
    Chapter 3 There Are No CNF Problems
  5. Altmetric Badge
    Chapter 4 Soundness of Inprocessing in Clause Sharing SAT Solvers
  6. Altmetric Badge
    Chapter 5 Exponential Separations in a Hierarchy of Clause Learning Proof Systems
  7. Altmetric Badge
    Chapter 6 On the Resolution Complexity of Graph Non-isomorphism
  8. Altmetric Badge
    Chapter 7 On Propositional QBF Expansions and Q-Resolution
  9. Altmetric Badge
    Chapter 8 Recovering and Utilizing Partial Duality in QBF
  10. Altmetric Badge
    Chapter 9 Theory and Applications of Satisfiability Testing – SAT 2013
  11. Altmetric Badge
    Chapter 10 Concurrent Clause Strengthening
  12. Altmetric Badge
    Chapter 11 Parallel MUS Extraction
  13. Altmetric Badge
    Chapter 12 A Modular Approach to MaxSAT Modulo Theories
  14. Altmetric Badge
    Chapter 13 Exploiting the Power of mip Solvers in maxsat
  15. Altmetric Badge
    Chapter 14 Community-Based Partitioning for MaxSAT Solving
  16. Altmetric Badge
    Chapter 15 Experiments with Reduction Finding
  17. Altmetric Badge
    Chapter 16 A Constraint Satisfaction Approach for Programmable Logic Detailed Placement
  18. Altmetric Badge
    Chapter 17 Minimizing Models for Tseitin-Encoded SAT Instances
  19. Altmetric Badge
    Chapter 18 Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
  20. Altmetric Badge
    Chapter 19 Quantified Maximum Satisfiability:
  21. Altmetric Badge
    Chapter 20 Nested Boolean Functions as Models for Quantified Boolean Formulas
  22. Altmetric Badge
    Chapter 21 Theory and Applications of Satisfiability Testing – SAT 2013
  23. Altmetric Badge
    Chapter 22 On the Interpolation between Product-Based Message Passing Heuristics for SAT
  24. Altmetric Badge
    Chapter 23 Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
  25. Altmetric Badge
    Chapter 24 A SAT Approach to Clique-Width
  26. Altmetric Badge
    Chapter 25 Cliquewidth and Knowledge Compilation
  27. Altmetric Badge
    Chapter 26 A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem
  28. Altmetric Badge
    Chapter 27 The Complexity of Theorem Proving in Autoepistemic Logic
  29. Altmetric Badge
    Chapter 28 Local Backbones
  30. Altmetric Badge
    Chapter 29 Upper and Lower Bounds for Weak Backdoor Set Detection
  31. Altmetric Badge
    Chapter 30 LearnSAT: A SAT Solver for Education
  32. Altmetric Badge
    Chapter 31 MUStICCa: MUS Extraction with Interactive Choice of Candidates
  33. Altmetric Badge
    Chapter 32 SCSat: A Soft Constraint Guided SAT Solver
  34. Altmetric Badge
    Chapter 33 Snappy: A Simple Algorithm Portfolio
  35. Altmetric Badge
    Chapter 34 Scarab : A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages

Readers on

mendeley
42 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 2013
Published by
Springer Berlin Heidelberg, June 2013
DOI 10.1007/978-3-642-39071-5
ISBNs
978-3-64-239070-8, 978-3-64-239071-5
Editors

Järvisalo, Matti, Van Gelder, Allen

X Demographics

X Demographics

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