Skip to main content
  • Conference proceedings
  • © 2008

Theory and Applications of Satisfiability Testing – SAT 2008

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

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing

Conference proceedings info: SAT 2008.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (27 papers)

  1. Front Matter

  2. Modelling Max-CSP as Partial Max-SAT

    • Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà
    Pages 1-14
  3. A Preprocessor for Max-SAT Solvers

    • Josep Argelich, Chu Min Li, Felip Manyà
    Pages 15-20
  4. A Generalized Framework for Conflict Analysis

    • G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, L. Sais
    Pages 21-27
  5. New Results on the Phase Transition for Random Quantified Boolean Formulas

    • Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol
    Pages 34-47
  6. Designing an Efficient Hardware Implication Accelerator for SAT Solving

    • John D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang
    Pages 48-62
  7. Attacking Bivium Using SAT Solvers

    • Tobias Eibach, Enrico Pilz, Gunnar Völkel
    Pages 63-76
  8. SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers

    • Germain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
    Pages 77-90
  9. Complexity and Algorithms for Well-Structured k-SAT Instances

    • Konstantinos Georgiou, Periklis A. Papakonstantinou
    Pages 105-118
  10. Online Estimation of SAT Solving Runtime

    • Shai Haim, Toby Walsh
    Pages 133-138
  11. A Max-SAT Inference-Based Pre-processing for Max-Clique

    • Federico Heras, Javier Larrosa
    Pages 139-152
  12. SAT, UNSAT and Coloring

    • Kazuo Iwama
    Pages 153-153
  13. Computation of Renameable Horn Backdoors

    • Stephan Kottler, Michael Kaufmann, Carsten Sinz
    Pages 154-160
  14. A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

    • Stephan Kottler, Michael Kaufmann, Carsten Sinz
    Pages 161-167
  15. Improvements to Hybrid Incremental SAT Algorithms

    • Florian Letombe, Joao Marques-Silva
    Pages 168-181
  16. Searching for Autarkies to Trim Unsatisfiable Clause Sets

    • Mark Liffiton, Karem Sakallah
    Pages 182-195
  17. Nenofex: Expanding NNF for QBF Solving

    • Florian Lonsing, Armin Biere
    Pages 196-210

Other Volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2008

About this book

This volume contains the papers presented at the 11th International Conference on Theory and Applications of Satis?ability Testing (SAT 2008). The series of International Conferences on Theory and Applications of S- is?ability Testing (SAT) has evolved from a ?rst workshop on SAT in 1996 to an annual international conference which is a platform for researchers studying various aspects of the propositional satis?ability problem and its applications. In the past, the SAT conference venue alternated between Europe and North America. For the ?rst time, the conference venue was in Asia, more precisely at the Zhudao Guest House, near Sun Yat-Sen University in Guangzhou, P. R. China. Many hard combinatorial problems can be encoded into SAT. Therefore - provementsonheuristics onthe practicalside,as wellastheoreticalinsightsinto SAT apply to a large range of real-world problems. More speci?cally, many - portant practical veri?cation problems can be rephrased as SAT problems. This applies to veri?cation problems in hardware and software. Thus SAT is bec- ing one of the most important core technologies to verify secure and dependable systems. The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, s- pli?ers, tools, case studies, and empirical results. SAT is interpreted in a rather broad sense: besides propositional satis?ability, it includes, for example, the - main of quanti?ed Boolean formulae (QBF) and satis?ability modulo theories (SMT).

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
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions