Book Volume 4501 2007

Theory and Applications of Satisfiability Testing – SAT 2007

10th International Conference, Lisbon, Portugal, May 28-31, 2007. Proceedings

Editors:

ISBN: 978-3-540-72787-3 (Print) 978-3-540-72788-0 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-2

    SAT: Past and Future

  3. Chapter

    Pages 3-3

    Encodings of Problems in Effectively Propositional Logic

  4. No Access

    Chapter

    Pages 4-9

    Efficient Circuit to CNF Conversion

  5. No Access

    Chapter

    Pages 10-15

    Mapping CSP into Many-Valued SAT

  6. No Access

    Chapter

    Pages 16-21

    Circuit Based Encoding of CNF Formula

  7. No Access

    Chapter

    Pages 22-27

    Breaking Symmetries in SAT Matrix Models

  8. No Access

    Chapter

    Pages 28-40

    Partial Max-SAT Solvers with Clause Learning

  9. No Access

    Chapter

    Pages 41-55

    MiniMaxSat: A New Weighted Max-SAT Solver

  10. No Access

    Chapter

    Pages 56-69

    Solving Multi-objective Pseudo-Boolean Problems

  11. No Access

    Chapter

    Pages 70-79

    Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

  12. No Access

    Chapter

    Pages 80-93

    Horn Upper Bounds and Renaming

  13. No Access

    Chapter

    Pages 94-99

    Matched Formulas and Backdoor Sets

  14. No Access

    Chapter

    Pages 100-106

    Short XORs for Model Counting: From Theory to Practice

  15. No Access

    Chapter

    Pages 107-120

    Variable Dependency in Local Search: Prevention Is Better Than Cure

  16. No Access

    Chapter

    Pages 121-133

    Combining Adaptive Noise and Look-Ahead in Local Search for SAT

  17. No Access

    Chapter

    Pages 134-147

    From Idempotent Generalized Boolean Assignments to Multi-bit Search

  18. No Access

    Chapter

    Pages 148-158

    Satisfiability with Exponential Families

  19. No Access

    Chapter

    Pages 159-172

    Formalizing Dangerous SAT Encodings

  20. No Access

    Chapter

    Pages 173-186

    Algorithms for Variable-Weighted 2-SAT and Dual Problems

  21. No Access

    Chapter

    Pages 187-200

    On the Boolean Connectivity Problem for Horn Relations

previous Page of 2