Book Volume 9710 2016

Theory and Applications of Satisfiability Testing – SAT 2016

19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings

Editors:

ISBN: 978-3-319-40969-6 (Print) 978-3-319-40970-2 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XXIV

  2. Complexity

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-12

      Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

    3. No Access

      Chapter

      Pages 13-28

      Satisfiability via Smooth Pictures

    4. No Access

      Chapter

      Pages 29-44

      Solution-Graphs of Boolean Formulas and Isomorphism

    5. No Access

      Chapter

      Pages 45-59

      Strong Backdoors for Default Logic

    6. No Access

      Chapter

      Pages 60-76

      The Normalized Autocorrelation Length of Random Max  \(r\) -Sat Converges in Probability to \((1-1/2^r)/r\)

    7. No Access

      Chapter

      Pages 77-84

      Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle

  3. Satisfiability Solving

    1. Front Matter

      Pages 85-85

    2. No Access

      Chapter

      Pages 87-103

      Extreme Cases in SAT Problems

    3. No Access

      Chapter

      Pages 104-122

      Improved Static Symmetry Breaking for SAT

    4. No Access

      Chapter

      Pages 123-140

      Learning Rate Based Branching Heuristic for SAT Solvers

    5. No Access

      Chapter

      Pages 141-159

      On the Hardness of SAT with Community Structure

    6. No Access

      Chapter

      Pages 160-176

      Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

  4. Satisfiability Applications

    1. Front Matter

      Pages 177-177

    2. No Access

      Chapter

      Pages 179-195

      A SAT Approach to Branchwidth

    3. No Access

      Chapter

      Pages 196-211

      Computing Maximum Unavoidable Subgraphs Using SAT Solvers

    4. No Access

      Chapter

      Pages 212-227

      Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT

    5. No Access

      Chapter

      Pages 228-245

      Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

  5. Satisfiability Modulo Theory

    1. Front Matter

      Pages 247-247

    2. No Access

      Chapter

      Pages 249-266

      Deciding Bit-Vector Formulas with mcSAT

    3. No Access

      Chapter

      Pages 267-283

      Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams

    4. No Access

      Chapter

      Pages 284-301

      Speeding up the Constraint-Based Method in Difference Logic

    5. No Access

      Chapter

      Pages 302-320

      Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers

  6. Beyond SAT

    1. Front Matter

      Pages 321-321

    2. No Access

      Chapter

      Pages 323-341

      Finding Finite Models in Multi-sorted First-Order Logic

previous Page of 2