↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2018

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
  3. Altmetric Badge
    Chapter 2 Approximately Propagation Complete and Conflict Propagating Constraint Encodings
  4. Altmetric Badge
    Chapter 3 Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
  5. Altmetric Badge
    Chapter 4 Solving MaxSAT with Bit-Vector Optimization
  6. Altmetric Badge
    Chapter 5 Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
  7. Altmetric Badge
    Chapter 6 Machine Learning-Based Restart Policy for CDCL SAT Solvers
  8. Altmetric Badge
    Chapter 7 Chronological Backtracking
  9. Altmetric Badge
    Chapter 8 Centrality-Based Improvements to CDCL Heuristics
  10. Altmetric Badge
    Chapter 9 Fast Sampling of Perfectly Uniform Satisfying Assignments
  11. Altmetric Badge
    Chapter 10 Fast and Flexible Probabilistic Model Counting
  12. Altmetric Badge
    Chapter 11 Exploiting Treewidth for Projected Model Counting and Its Limits
  13. Altmetric Badge
    Chapter 12 Circuit-Based Search Space Pruning in QBF
  14. Altmetric Badge
    Chapter 13 Symmetries of Quantified Boolean Formulas
  15. Altmetric Badge
    Chapter 14 Local Soundness for QBF Calculi
  16. Altmetric Badge
    Chapter 15 QBF as an Alternative to Courcelle’s Theorem
  17. Altmetric Badge
    Chapter 16 Polynomial-Time Validation of QCDCL Certificates
  18. Altmetric Badge
    Chapter 17 Sharpness of the Satisfiability Threshold for Non-uniform Random k -SAT
  19. Altmetric Badge
    Chapter 18 In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
  20. Altmetric Badge
    Chapter 19 Cops-Robber Games and the Resolution of Tseitin Formulas
  21. Altmetric Badge
    Chapter 20 Minimal Unsatisfiability and Minimal Strongly Connected Digraphs
  22. Altmetric Badge
    Chapter 21 Finding All Minimal Safe Inductive Sets
  23. Altmetric Badge
    Chapter 22 Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition
  24. Altmetric Badge
    Chapter 23 Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
  25. Altmetric Badge
    Chapter 24 XOR-Satisfiability Set Membership Filters
  26. Altmetric Badge
    Chapter 25 ALIAS: A Modular Tool for Finding Backdoors for SAT
  27. Altmetric Badge
    Chapter 26 PySAT: A Python Toolkit for Prototyping with SAT Oracles
  28. Altmetric Badge
    Chapter 27 Constrained Image Generation Using Binarized Neural Networks with Decision Procedures
Attention for Chapter 7: Chronological Backtracking
Altmetric Badge

Mentioned by

1 tweeter


1 Dimensions

Readers on

6 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
Chronological Backtracking
Chapter number 7
Book title
Theory and Applications of Satisfiability Testing – SAT 2018
Published by
Springer, Cham, July 2018
DOI 10.1007/978-3-319-94144-8_7
Book ISBNs
978-3-31-994143-1, 978-3-31-994144-8

Alexander Nadel, Vadim Ryvchin

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 33%
Professor > Associate Professor 1 17%
Student > Bachelor 1 17%
Student > Ph. D. Student 1 17%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 4 67%
Engineering 1 17%
Unknown 1 17%