Theory and Applications of Satisfiability Testing

6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers

Editors:

ISBN: 978-3-540-20851-8 (Print) 978-3-540-24605-3 (Online)

Table of contents (38 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-13

    Satisfiability and Computing van der Waerden Numbers

  3. No Access

    Book Chapter

    Pages 14-24

    An Algorithm for SAT Above the Threshold

  4. No Access

    Book Chapter

    Pages 25-36

    Watched Data Structures for QBF Solvers

  5. No Access

    Book Chapter

    Pages 37-52

    How Good Can a Resolution Based SAT-solver Be?

  6. No Access

    Book Chapter

    Pages 53-68

    A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation

  7. No Access

    Book Chapter

    Pages 69-77

    Density Condensation of Boolean Formulas

  8. No Access

    Book Chapter

    Pages 78-92

    SAT Based Predicate Abstraction for Hardware Verification

  9. No Access

    Book Chapter

    Pages 93-104

    On Boolean Models for Quantified Boolean Horn Formulas

  10. No Access

    Book Chapter

    Pages 105-119

    Local Search on SAT-encoded Colouring Problems

  11. No Access

    Book Chapter

    Pages 120-134

    A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods

  12. No Access

    Book Chapter

    Pages 135-149

    Hidden Threshold Phenomena for Fixed-Density SAT-formulae

  13. No Access

    Book Chapter

    Pages 150-161

    Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs

  14. No Access

    Book Chapter

    Pages 162-171

    Width-Based Algorithms for SAT and CIRCUIT-SAT

  15. No Access

    Book Chapter

    Pages 172-187

    Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

  16. No Access

    Book Chapter

    Pages 188-202

    On Fixed-Parameter Tractable Parameterizations of SAT

  17. No Access

    Book Chapter

    Pages 203-213

    On the Probabilistic Approach to the Random Satisfiability Problem

  18. No Access

    Book Chapter

    Pages 214-228

    Comparing Different Prenexing Strategies for Quantified Boolean Formulas

  19. No Access

    Book Chapter

    Pages 229-241

    Solving Error Correction for Large Data Sets by Means of a SAT Solver

  20. No Access

    Book Chapter

    Pages 242-256

    Using Problem Structure for Efficient Clause Learning

  21. No Access

    Book Chapter

    Pages 257-271

    Abstraction-Driven SAT-based Analysis of Security Protocols

previous Page of 2