Theory and Applications of Satisfiability Testing – SAT 2008

11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings

  • Editors
  • Hans Kleine Büning
  • Xishun Zhao
Conference proceedings SAT 2008
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4996)

Table of contents

  1. Front Matter
  2. Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
    Pages 1-14
  3. Josep Argelich, Chu Min Li, Felip Manyà
    Pages 15-20
  4. G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, L. Sais
    Pages 21-27
  5. Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
    Pages 34-47
  6. John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang
    Pages 48-62
  7. Tobias Eibach, Enrico Pilz, Gunnar Völkel
    Pages 63-76
  8. Germain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
    Pages 77-90
  9. Konstantinos Georgiou, Periklis A. Papakonstantinou
    Pages 105-118
  10. Shai Haim, Toby Walsh
    Pages 133-138
  11. Federico Heras, Javier Larrosa
    Pages 139-152
  12. Kazuo Iwama
    Pages 153-153
  13. Stephan Kottler, Michael Kaufmann, Carsten Sinz
    Pages 154-160
  14. Stephan Kottler, Michael Kaufmann, Carsten Sinz
    Pages 161-167
  15. Florian Letombe, Joao Marques-Silva
    Pages 168-181
  16. Mark Liffiton, Karem Sakallah
    Pages 182-195
  17. Florian Lonsing, Armin Biere
    Pages 196-210

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008, held in Guangzhou, P. R. China, in May 2008.

The 17 revised full papers presented together with 8 revised short papers and 2 invited talks were carefully selected from 70 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.

Keywords

3-SAT Erfüllbarkeitsproblem der Aussagenlogik Resolution algorithm algorithms complexity constraint programming local search logic optimization probabilistic algorithms proof proof systems proof theory random walks

Bibliographic information

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