↓ Skip to main content
What is this page? Embed badge

Theory and Applications of Satisfiability Testing – SAT 2016

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Parameterized Compilation Lower Bounds for Restricted CNF-Formulas
  3. Altmetric Badge
    Chapter 2 Satisfiability via Smooth Pictures
  4. Altmetric Badge
    Chapter 3 Solution-Graphs of Boolean Formulas and Isomorphism
  5. Altmetric Badge
    Chapter 4 Strong Backdoors for Default Logic
  6. Altmetric Badge
    Chapter 5 The Normalized Autocorrelation Length of Random Max  \(r\) -Sat Converges in Probability to \((1-1/2^r)/r\)
  7. Altmetric Badge
    Chapter 6 Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle
  8. Altmetric Badge
    Chapter 7 Extreme Cases in SAT Problems
  9. Altmetric Badge
    Chapter 8 Improved Static Symmetry Breaking for SAT
  10. Altmetric Badge
    Chapter 9 Learning Rate Based Branching Heuristic for SAT Solvers
  11. Altmetric Badge
    Chapter 10 On the Hardness of SAT with Community Structure
  12. Altmetric Badge
    Chapter 11 Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
  13. Altmetric Badge
    Chapter 12 A SAT Approach to Branchwidth
  14. Altmetric Badge
    Chapter 13 Computing Maximum Unavoidable Subgraphs Using SAT Solvers
  15. Altmetric Badge
    Chapter 14 Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
  16. Altmetric Badge
    Chapter 15 Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
  17. Altmetric Badge
    Chapter 16 Deciding Bit-Vector Formulas with mcSAT
  18. Altmetric Badge
    Chapter 17 Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
  19. Altmetric Badge
    Chapter 18 Speeding up the Constraint-Based Method in Difference Logic
  20. Altmetric Badge
    Chapter 19 Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
  21. Altmetric Badge
    Chapter 20 Finding Finite Models in Multi-sorted First-Order Logic
  22. Altmetric Badge
    Chapter 21 MCS Extraction with Sublinear Oracle Queries
  23. Altmetric Badge
    Chapter 22 Predicate Elimination for Preprocessing in First-Order Theorem Proving
  24. Altmetric Badge
    Chapter 23 Incremental Determinization
  25. Altmetric Badge
    Chapter 24 Non-prenex QBF Solving Using Abstraction
  26. Altmetric Badge
    Chapter 25 On Q-Resolution and CDCL QBF Solving
  27. Altmetric Badge
    Chapter 26 On Stronger Calculi for QBFs
  28. Altmetric Badge
    Chapter 27 Q-Resolution with Generalized Axioms
  29. Altmetric Badge
    Chapter 28 2QBF: Challenges and Solutions
  30. Altmetric Badge
    Chapter 29 Dependency Schemes for DQBF
  31. Altmetric Badge
    Chapter 30 Lifting QBF Resolution Calculi to DQBF
  32. Altmetric Badge
    Chapter 31 Long Distance Q-Resolution with Dependency Schemes
  33. Altmetric Badge
    Chapter 32 BEACON: An Efficient SAT-Based Tool for Debugging \({\mathcal {EL}}{^+}\) Ontologies
  34. Altmetric Badge
    Chapter 33 HordeQBF: A Modular and Massively Parallel QBF Solver
  35. Altmetric Badge
    Chapter 34 LMHS: A SAT-IP Hybrid MaxSAT Solver
  36. Altmetric Badge
    Chapter 35 OpenSMT2: An SMT Solver for Multi-core and Cloud Computing
  37. Altmetric Badge
    Chapter 36 SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Attention for Chapter 35: OpenSMT2: An SMT Solver for Multi-core and Cloud Computing
Altmetric Badge

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
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
OpenSMT2: An SMT Solver for Multi-core and Cloud Computing
Chapter number 35
Book title
Theory and Applications of Satisfiability Testing – SAT 2016
Published in
Lecture notes in computer science, June 2016
DOI 10.1007/978-3-319-40970-2_35
Book ISBNs
978-3-31-940969-6, 978-3-31-940970-2
Authors

Antti E. J. Hyvärinen, Matteo Marescotti, Leonardo Alt, Natasha Sharygina

Editors

Nadia Creignou, Daniel Le Berre

View on publisher site
Mendeley readers

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%

This page is provided by Altmetric.