Modelling Max-CSP as Partial Max-SAT -- A Preprocessor for Max-SAT Solvers -- A Generalized Framework for Conflict Analysis -- Adaptive Restart Strategies for Conflict Driven SAT Solvers -- New Results on the Phase Transition for Random Quantified Boolean Formulas -- Designing an Efficient Hardware Implication Accelerator for SAT Solving -- Attacking Bivium Using SAT Solvers -- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers -- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms -- Complexity and Algorithms for Well-Structured k-SAT Instances -- A Decision-Making Procedure for Resolution-Based SAT-Solvers -- Online Estimation of SAT Solving Runtime -- A Max-SAT Inference-Based Pre-processing for Max-Clique -- SAT, UNSAT and Coloring -- Computation of Renameable Horn Backdoors -- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors -- Improvements to Hybrid Incremental SAT Algorithms -- Searching for Autarkies to Trim Unsatisfiable Clause Sets -- Nenofex: Expanding NNF for QBF Solving -- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions -- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms -- A CNF Class Generalizing Exact Linear Formulas -- How Many Conflicts Does It Need to Be Unsatisfiable? -- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning -- Local Restarts -- Regular and General Resolution: An Improved Separation -- Finding Guaranteed MUSes Fast.