↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2020

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Sorting Parity Encodings by Reusing Variables
  3. Altmetric Badge
    Chapter 2 Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving
  4. Altmetric Badge
    Chapter 3 Clause Size Reduction with all-UIP Learning
  5. Altmetric Badge
    Chapter 4 Trail Saving on Backtrack
  6. Altmetric Badge
    Chapter 5 Four Flavors of Entailment
  7. Altmetric Badge
    Chapter 6 Designing New Phase Selection Heuristics
  8. Altmetric Badge
    Chapter 7 On the Effect of Learned Clauses on Stochastic Local Search
  9. Altmetric Badge
    Chapter 8 SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers
  10. Altmetric Badge
    Chapter 9 Distributed Cube and Conquer with Paracooba
  11. Altmetric Badge
    Chapter 10 Reproducible Efficient Parallel SAT Solving
  12. Altmetric Badge
    Chapter 11 Improving Implementation of SAT Competitions 2017–2019 Winners
  13. Altmetric Badge
    Chapter 12 On CDCL-Based Proof Systems with the Ordered Decision Strategy
  14. Altmetric Badge
    Chapter 13 Equivalence Between Systems Stronger Than Resolution
  15. Altmetric Badge
    Chapter 14 Simplified and Improved Separations Between Regular and General Resolution by Lifting
  16. Altmetric Badge
    Chapter 15 Mycielski Graphs and $$\mathrm {PR}$$ Proofs
  17. Altmetric Badge
    Chapter 16 Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems
  18. Altmetric Badge
    Chapter 17 Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
  19. Altmetric Badge
    Chapter 18 On the Sparsity of XORs in Approximate Model Counting
  20. Altmetric Badge
    Chapter 19 A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
  21. Altmetric Badge
    Chapter 20 Abstract Cores in Implicit Hitting Set MaxSat Solving
  22. Altmetric Badge
    Chapter 21 MaxSAT Resolution and Subcube Sums
  23. Altmetric Badge
    Chapter 22 A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
  24. Altmetric Badge
    Chapter 23 On Weakening Strategies for PB Solvers
  25. Altmetric Badge
    Chapter 24 Reasoning About Strong Inconsistency in ASP
  26. Altmetric Badge
    Chapter 25 Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
  27. Altmetric Badge
    Chapter 26 Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases
  28. Altmetric Badge
    Chapter 27 Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
  29. Altmetric Badge
    Chapter 28 Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
  30. Altmetric Badge
    Chapter 29 Short Q-Resolution Proofs with Homomorphisms
  31. Altmetric Badge
    Chapter 30 Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
  32. Altmetric Badge
    Chapter 31 Positional Games and QBF: The  Corrective Encoding
  33. Altmetric Badge
    Chapter 32 Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles
  34. Altmetric Badge
    Chapter 33 Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
  35. Altmetric Badge
    Chapter 34 SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing
  36. Altmetric Badge
    Chapter 35 SAT-Based Encodings for Optimal Decision Trees with Explicit Paths
  37. Altmetric Badge
    Chapter 36 Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
Attention for Chapter 25: Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
Altmetric Badge
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.
Chapter title
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
Chapter number 25
Book title
Theory and Applications of Satisfiability Testing – SAT 2020
Published by
Springer, Cham, July 2020
DOI 10.1007/978-3-030-51825-7_25
Book ISBNs
978-3-03-051824-0, 978-3-03-051825-7
Authors

Markus Hecher, Patrick Thier, Stefan Woltran