Theory and Applications of Satisfiability Testing - SAT 2009: 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings

This volume contains the papers presented at SAT 2009: 12th International Conference on Theory and Applications of Satis?ability Testing, held from June 30 to July 3, 2009 in Swansea (UK). The International Conference on Theory and Applications of Satis?ability Testing (SAT) started in 1996 as a series of workshops, and, in parallel with the growthof SAT, developedinto the main eventfor SAT research. This year’sc- ference testi?ed to the strong interest in SAT, regarding theoretical research,- searchonalgorithms,investigationsintoapplications,anddevelopmentofsolvers and software systems. As a core problem of computer science, SAT is central for many research areas, and has deep interactions with many mathematical s- jects. Major impulses for the development of SAT came from concrete practical applications as well as from fundamental theoretical research. This fruitful c- laboration can be seen in virtually all papers of this volume. There were 86 submissions (completed papers within the scope of the c- ference). Each submission was reviewed by at least three, and on average 4. 0 Programme Committee members. The Committee decided to accept 45 papers, consisting of 34 regular and 11 short papers (restricted to 6 pages). A main n- elty was a “shepherding process”, where 29% of the papers were accepted only conditionally, and requirements on necessary improvements were formulated by the ProgrammeCommittee and its installment monitored by the “shepherd” for thatpaper(using possibly severalroundsoffeedback).

Table of Contents:
Invited Talks.- SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms.- Symbolic Techniques in Propositional Satisfiability Solving.- Applications of SAT.- Efficiently Calculating Evolutionary Tree Measures Using SAT.- Finding Lean Induced Cycles in Binary Hypercubes.- Finding Efficient Circuits Using SAT-Solvers.- Encoding Treewidth into SAT.- Complexity Theory.- The Complexity of Reasoning for Fragments of Default Logic.- Does Advice Help to Prove Propositional Tautologies?.- Structures for SAT.- Backdoors in the Context of Learning.- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.- On Some Aspects of Mixed Horn Formulas.- Variable Influences in Conjunctive Normal Forms.- Resolution and SAT.- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.- An Exponential Lower Bound for Width-Restricted Clause Learning.- Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces.- Boundary Points and Resolution.- Translations to CNF.- Sequential Encodings from Max-CSP into Partial Max-SAT.- Cardinality Networks and Their Applications.- New Encodings of Pseudo-Boolean Constraints into CNF.- Efficient Term-ITE Conversion for Satisfiability Modulo Theories.- Techniques for Conflict-Driven SAT Solvers.- On-the-Fly Clause Improvement.- Dynamic Symmetry Breaking by Simulating Zykov Contraction.- Minimizing Learned Clauses.- Extending SAT Solvers to Cryptographic Problems.- Solving SAT by Local Search.- Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability.- A Theoretical Analysis of Search in GSAT.- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.- Hybrid SAT Solvers.- A Novel Approach to Combine a SLS- and a DPLL-Solverfor the Satisfiability Problem.- Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques.- Automatic Adaption of SAT Solvers.- Restart Strategy Selection Using Machine Learning Techniques.- Instance-Based Selection of Policies for SAT Solvers.- Width-Based Restart Policies for Clause-Learning Satisfiability Solvers.- Problem-Sensitive Restart Heuristics for the DPLL Procedure.- Stochastic Approaches to SAT Solving.- (1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.- VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search.- QBFs and Their Representations.- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.- A Compact Representation for Syntactic Dependencies in QBFs.- Beyond CNF: A Circuit-Based QBF Solver.- Optimisation Algorithms.- Solving (Weighted) Partial MaxSAT through Satisfiability Testing.- Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?.- Relaxed DPLL Search for MaxSAT.- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates.- Exploiting Cycle Structures in Max-SAT.- Generalizing Core-Guided Max-SAT.- Algorithms for Weighted Boolean Optimization.- Distributed and Parallel Solving.- PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing.- c-sat: A Parallel SAT Solver for Clusters.