Theory and Applications of Satisfiability Testing – SAT 2010

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

  • Ofer Strichman
  • Stefan Szeider

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

Table of contents

  1. Front Matter
  2. Part 1. Invited Talks

  3. Part 2. Regular Papers

    1. Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
      Pages 30-43
    2. Robert Brummayer, Florian Lonsing, Armin Biere
      Pages 44-57
    3. Carsten Fuhs, Peter Schneider-Kamp
      Pages 71-84
    4. Enrico Giunchiglia, Paolo Marin, Massimo Narizzano
      Pages 85-98
    5. Hadi Katebi, Karem A. Sakallah, Igor L. Markov
      Pages 113-127
    6. William Klieber, Samir Sapra, Sicun Gao, Edmund Clarke
      Pages 128-142
    7. Stephan Kottler
      Pages 143-157
    8. Florian Lonsing, Armin Biere
      Pages 158-171
    9. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
      Pages 172-180
    10. Vasco Manquinho, Ruben Martins, Inês Lynce
      Pages 181-193
    11. Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker
      Pages 194-208

About these proceedings

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

Editors and affiliations

  • Ofer Strichman
    • 1
  • Stefan Szeider
    • 2
  1. 1.Technion, Technion CityHaifaIsrael
  2. 2.Vienna University of TechnologyViennaAustria

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14186-7
  • Copyright Information Springer-Verlag Heidelberg Berlin 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14185-0
  • Online ISBN 978-3-642-14186-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book