Theory and Applications of Satisfiability Testing

8th International Conference, SAT 2005, St Andrews, UK, June 19-23, 2005. Proceedings

  • Fahiem Bacchus
  • Toby Walsh
Conference proceedings SAT 2005

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

Table of contents

  1. Front Matter
  2. Preface

    1. Josep Argelich, Felip Manyà
      Pages 1-15
    2. Gilles Audemard, Lakhdar Saïs
      Pages 16-30
    3. Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
      Pages 46-60
    4. Nicola Galesi, Neil Thapen
      Pages 76-90
    5. Ian P. Gent, Andrew G. D. Rowley
      Pages 91-106
    6. Edward A. Hirsch, Sergey I. Nikolenko
      Pages 135-142
    7. Michal Kouril, John Franco
      Pages 143-157
    8. Mark H. Liffiton, Karem A. Sakallah
      Pages 173-186
    9. Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin Rinard
      Pages 187-202
    10. Daniel Rolf
      Pages 216-225
    11. Tian Sang, Paul Beame, Henry Kautz
      Pages 226-240
    12. Hossein M. Sheini, Karem A. Sakallah
      Pages 241-256
    13. Carsten Sinz, Edda-Maria Dieringer
      Pages 257-268

About these proceedings


The 8th International Conference on Theory and Applications of Satis?ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis?ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the ?rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis?ability testing has proved to extremely useful in a wide range of di?erent disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most e?ective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools. This volume contains the papers accepted for presentation at SAT 2005. The conference attracted a record number of 73 submissions. Of these, 26 papers were accepted for presentation in the technical programme. In addition, 16 - pers were accepted as shorter papers and were presented as posters during the technicalprogramme.Theacceptedpapersandposterpaperscoverthefullrange of topics listed in the call for papers.


3-SAT Arithmetic QBF SAT algorithms algorithms learning logic optimization probabilistic algorithms proof proof theory propositional logic resolution satisfiability satisfiability testing

Editors and affiliations

  • Fahiem Bacchus
    • 1
  • Toby Walsh
    • 2
  1. 1.Department of Computer ScienceUniversity of TorontoCanada
  2. 2.Dept. of Computer ScienceTrinity CollegeDublin 2

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-26276-3
  • Online ISBN 978-3-540-31679-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book