↓ Skip to main content

Theory and Applications of Satisfiability Testing – SAT 2015

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
  3. Altmetric Badge
    Chapter 2 PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
  4. Altmetric Badge
    Chapter 3 Speeding up MUS Extraction with Preprocessing and Chunking
  5. Altmetric Badge
    Chapter 4 Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
  6. Altmetric Badge
    Chapter 5 Laissez-Faire Caching for Parallel #SAT Solving
  7. Altmetric Badge
    Chapter 6 SATGraf : Visualizing the Evolution of SAT Formula Structure in Solvers
  8. Altmetric Badge
    Chapter 7 Hints Revealed
  9. Altmetric Badge
    Chapter 8 Mining Backbone Literals in Incremental SAT
  10. Altmetric Badge
    Chapter 9 Constructing SAT Filters with a Quantum Annealer
  11. Altmetric Badge
    Chapter 10 $$\#\exists $$ SAT: Projected Model Counting
  12. Altmetric Badge
    Chapter 11 Theory and Applications of Satisfiability Testing -- SAT 2015
  13. Altmetric Badge
    Chapter 12 HordeSat: A Massively Parallel Portfolio SAT Solver
  14. Altmetric Badge
    Chapter 13 Preprocessing for DQBF
  15. Altmetric Badge
    Chapter 14 Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
  16. Altmetric Badge
    Chapter 15 On Compiling CNFs into Structured Deterministic DNNFs
  17. Altmetric Badge
    Chapter 16 SpySMAC : Automated Configuration and Performance Analysis of SAT Solvers
  18. Altmetric Badge
    Chapter 17 Community Structure Inspired Algorithms for SAT and #SAT
  19. Altmetric Badge
    Chapter 18 Using Community Structure to Detect Relevant Learnt Clauses
  20. Altmetric Badge
    Chapter 19 Recognition of Nested Gates in CNF Formulas
  21. Altmetric Badge
    Chapter 20 Exploiting Resolution-Based Representations for MaxSAT Solving
  22. Altmetric Badge
    Chapter 21 Theory and Applications of Satisfiability Testing -- SAT 2015
  23. Altmetric Badge
    Chapter 22 Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
  24. Altmetric Badge
    Chapter 23 Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
  25. Altmetric Badge
    Chapter 24 Theory and Applications of Satisfiability Testing -- SAT 2015
  26. Altmetric Badge
    Chapter 25 QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
  27. Altmetric Badge
    Chapter 26 SMT-RAT : An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
  28. Altmetric Badge
    Chapter 27 Search-Space Partitioning for Parallelizing SMT Solvers
  29. Altmetric Badge
    Chapter 28 A New Approach to Partial MUS Enumeration
  30. Altmetric Badge
    Chapter 29 Evaluating CDCL Variable Scoring Schemes
  31. Altmetric Badge
    Chapter 30 Theory and Applications of Satisfiability Testing -- SAT 2015
Attention for Chapter 3: Speeding up MUS Extraction with Preprocessing and Chunking
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 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
Speeding up MUS Extraction with Preprocessing and Chunking
Chapter number 3
Book title
Theory and Applications of Satisfiability Testing -- SAT 2015
Published by
Springer, Cham, September 2015
DOI 10.1007/978-3-319-24318-4_3
Book ISBNs
978-3-31-924317-7, 978-3-31-924318-4
Authors

Valeriy Balabanov, Alexander Ivrii, Balabanov, Valeriy, Ivrii, Alexander

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 100%
Readers by discipline Count As %
Computer Science 1 100%