2006

SAT 2005

Satisfiability Research in the Year 2005

Editors:

ISBN: 978-1-4020-4552-3 (Print) 978-1-4020-5571-3 (Online)

Table of contents (12 chapters)

  1. Front Matter

    Pages i-v

  2. No Access

    Book Chapter

    Pages 1-2

    Satisfiability in the Year 2005

  3. No Access

    Book Chapter

    Pages 3-24

    Heuristic-Based Backtracking Relaxation for Propositional Satisfiability

  4. No Access

    Book Chapter

    Pages 25-50

    Symbolic Techniques in Satisfiability Solving

  5. No Access

    Book Chapter

    Pages 51-72

    Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

  6. No Access

    Book Chapter

    Pages 73-88

    Backdoor Sets for DLL Subsolvers

  7. No Access

    Book Chapter

    Pages 89-95

    The Complexity of Pure Literal Elimination

  8. No Access

    Book Chapter

    Pages 97-142

    Clause Weighting Local Search for SAT

  9. No Access

    Book Chapter

    Pages 143-179

    Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings

  10. No Access

    Book Chapter

    Pages 181-200

    Regular Random k-SAT: Properties of Balanced Formulas

  11. No Access

    Book Chapter

    Pages 201-235

    Applying SAT Solving in Classification of Finite Algebras

  12. No Access

    Book Chapter

    Pages 237-263

    The SAT-based Approach to Separation Logic

  13. No Access

    Book Chapter

    Pages 265-293

    MathSAT: Tight Integration of SAT and Mathematical Decision Procedures