Theory and Applications of Satisfiability Testing - SAT 2006

9th International Conference, Seattle, WA, USA, August 12-15, 2006. Proceedings

  • Armin Biere
  • Carla P. Gomes
Conference proceedings SAT 2006
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4121)

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Hossein M. Sheini, Karem A. Sakallah
      Pages 1-9
    2. Fahiem Bacchus
      Pages 10-10
  3. Session 1. Proofs and Cores

    1. Arist Kojevnikov, Alexander S. Kulikov
      Pages 11-21
    2. Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
      Pages 36-41
    3. Joshua Buresh-Oppenheim, David Mitchell
      Pages 42-47
    4. Toni Jussila, Carsten Sinz, Armin Biere
      Pages 54-60
  4. Session 2. Heuristics and Algorithms

    1. Mark Chavira, Adnan Darwiche
      Pages 61-74
    2. Himanshu Jain, Constantinos Bartzis, Edmund Clarke
      Pages 75-89
  5. Session 3. Applications

  6. Session 4. SMT

    1. Yinlei Yu, Sharad Malik
      Pages 142-155
    2. Robert Nieuwenhuis, Albert Oliveras
      Pages 156-169

About these proceedings

Keywords

QBF SAT solvers SMT algorithms bioinformatics calculus complexity description logics heuristics learning local search optimization random walks resolution satisfiability testing

Editors and affiliations

  • Armin Biere
    • 1
  • Carla P. Gomes
    • 2
  1. 1.Institute for Formal Models and VerificationJohannes Kepler UniversityLinzAustria
  2. 2.Department of Computer ScienceCornell UniversityIthacaU.S.A.

Bibliographic information

  • DOI https://doi.org/10.1007/11814948
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-37206-6
  • Online ISBN 978-3-540-37207-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349