↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2017

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Probabilistic Model Counting with Short XORs
  3. Altmetric Badge
    Chapter 2 Backdoor Treewidth for SAT
  4. Altmetric Badge
    Chapter 3 New Width Parameters for Model Counting
  5. Altmetric Badge
    Chapter 4 Hard Satisfiable Formulas for Splittings by Linear Combinations
  6. Altmetric Badge
    Chapter 5 On the Community Structure of Bounded Model Checking SAT Problems
  7. Altmetric Badge
    Chapter 6 Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT
  8. Altmetric Badge
    Chapter 7 An Adaptive Prefix-Assignment Technique for Symmetry Reduction
  9. Altmetric Badge
    Chapter 8 An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
  10. Altmetric Badge
    Chapter 9 Coverage-Based Clause Reduction Heuristics for CDCL Solvers
  11. Altmetric Badge
    Chapter 10 (I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals
  12. Altmetric Badge
    Chapter 11 On Tackling the Limits of Resolution in SAT Solving
  13. Altmetric Badge
    Chapter 12 Improving MCS Enumeration via Caching
  14. Altmetric Badge
    Chapter 13 Introducing Pareto Minimal Correction Subsets
  15. Altmetric Badge
    Chapter 14 A Distributed Version of S yrup
  16. Altmetric Badge
    Chapter 15 PaInleSS: A Framework for Parallel SAT Solving
  17. Altmetric Badge
    Chapter 16 A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers
  18. Altmetric Badge
    Chapter 17 Shortening QBF Proofs with Dependency Schemes
  19. Altmetric Badge
    Chapter 18 A Little Blocked Literal Goes a Long Way
  20. Altmetric Badge
    Chapter 19 Dependency Learning for QBF
  21. Altmetric Badge
    Chapter 20 A Resolution-Style Proof System for DQBF
  22. Altmetric Badge
    Chapter 21 From DQBF to QBF by Dependency Elimination
  23. Altmetric Badge
    Chapter 22 Theory Refinement for Program Verification
  24. Altmetric Badge
    Chapter 23 On Simplification of Formulas with Unconstrained Variables and Quantifiers
  25. Altmetric Badge
    Chapter 24 A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic
  26. Altmetric Badge
    Chapter 25 SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
  27. Altmetric Badge
    Chapter 26 A Lower Bound on CNF Encodings of the At-Most-One Constraint
  28. Altmetric Badge
    Chapter 27 SAT-Encodings for Special Treewidth and Pathwidth
  29. Altmetric Badge
    Chapter 28 MaxPre: An Extended MaxSAT Preprocessor
  30. Altmetric Badge
    Chapter 29 The GRAT Tool Chain
  31. Altmetric Badge
    Chapter 30 CNFgen: A Generator of Crafted Benchmarks
Attention for Chapter 15: PaInleSS: A Framework for Parallel SAT Solving
Altmetric Badge

Mentioned by

video
1 video uploader

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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.
Chapter title
PaInleSS: A Framework for Parallel SAT Solving
Chapter number 15
Book title
Theory and Applications of Satisfiability Testing – SAT 2017
Published by
Springer, Cham, August 2017
DOI 10.1007/978-3-319-66263-3_15
Book ISBNs
978-3-31-966262-6, 978-3-31-966263-3
Authors

Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Computer Science 2 100%