Skip to main content
  • Conference proceedings
  • © 2010

Theory and Applications of Satisfiability Testing - SAT 2010

13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6175)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing

Conference proceedings info: SAT 2010.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (37 papers)

  1. Front Matter

  2. Part 2. Regular Papers

    1. Proof Complexity of Propositional Default Logic

      • Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
      Pages 30-43
    2. Automated Testing and Debugging of SAT and QBF Solvers

      • Robert Brummayer, Florian Lonsing, Armin Biere
      Pages 44-57
    3. Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT

      • Carsten Fuhs, Peter Schneider-Kamp
      Pages 71-84
    4. sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning

      • Enrico Giunchiglia, Paolo Marin, Massimo Narizzano
      Pages 85-98
    5. Symmetry and Satisfiability: An Update

      • Hadi Katebi, Karem A. Sakallah, Igor L. Markov
      Pages 113-127
    6. A Non-prenex, Non-clausal QBF Solver with Game-State Learning

      • William Klieber, Samir Sapra, Sicun Gao, Edmund Clarke
      Pages 128-142
    7. SAT Solving with Reference Points

      • Stephan Kottler
      Pages 143-157
    8. Integrating Dependency Schemes in Search-Based QBF Solvers

      • Florian Lonsing, Armin Biere
      Pages 158-171
    9. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF

      • Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
      Pages 172-180
    10. Improving Unsatisfiability-Based Algorithms for Boolean Optimization

      • Vasco Manquinho, Ruben Martins, Inês Lynce
      Pages 181-193
    11. Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs

      • Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker
      Pages 194-208

Other Volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2010

Keywords

  • MiniSAT
  • SAT algorithms
  • SAT complexity
  • SAT translation
  • algorithms
  • combinatorics
  • complexity
  • computational complexity
  • distributed algorithms
  • k-SAT
  • logic
  • polynomial time reduction
  • proof complexity
  • satisfiability testing
  • structured analysis
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Technion, Technion City, Haifa, Israel

    Ofer Strichman

  • Vienna University of Technology, Vienna, Austria

    Stefan Szeider

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions