Theoretical Computer Science and General Issues

Theory and Applications of Satisfiability Testing

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

Editors: Bacchus, Fahiem, Walsh, Toby (Eds.)

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-31679-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-540-26276-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (42 chapters)

  • Solving Over-Constrained Problems with SAT Technology

    Argelich, Josep (et al.)

    Pages 1-15

  • A Symbolic Search Based Approach for Quantified Boolean Formulas

    Audemard, Gilles (et al.)

    Pages 16-30

  • Substitutional Definition of Satisfiability in Classical Propositional Logic

    Belov, Anton (et al.)

    Pages 31-45

  • A Clause-Based Heuristic for SAT Solvers

    Dershowitz, Nachum (et al.)

    Pages 46-60

  • Effective Preprocessing in SAT Through Variable and Clause Elimination

    Eén, Niklas (et al.)

    Pages 61-75

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-31679-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-540-26276-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Theory and Applications of Satisfiability Testing
Book Subtitle
8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings
Editors
  • Fahiem Bacchus
  • Toby Walsh
Series Title
Theoretical Computer Science and General Issues
Series Volume
3569
Copyright
2005
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-31679-4
DOI
10.1007/b137280
Softcover ISBN
978-3-540-26276-3
Edition Number
1
Number of Pages
XII, 492
Topics