---

This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.

The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.

---

Computational Sustainability: Computing for a Better World.- Machine Learning in Automated and Interactive Theorem Proving.- Circular (Yet Sound) Proofs.- Short Proofs in QBF Expansion.- Proof Complexity of QBF Symmetry Recomputation.- Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model.- DRAT Proofs, Propagation Redundancy, and Extended Resolution.- Knowledge Compilation Languages as Proof Systems.- The Equivalences of Refutational QRAT.- A SAT-based System for Consistent Query Answering.- Incremental Inprocessing in SAT Solving.- Local Search for Fast Matrix Multiplication.- Speeding Up Assumption-Based SAT.- Simplifying CDCL Clause Database Reduction.- QRAT Polynomially Simulates nforall-Exp+Res.- QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties.- On Computing the Union of MUSes.- Revisiting Graph Width Measures for CNF-Encodings.- DRMaxSAT with MaxHS: First Contact.- Backing Backtracking.- Assessing Heuristic Machine Learning Explanations with Model Counting.- Syntax-Guided Rewrite Rule Enumeration for SMT Solvers.- DRAT-based Bit-Vector Proofs in CVC4.- Combining Resolution-Path Dependencies with Dependency Learning.- Proof Complexity of Fragments of Long-Distance Q-Resolution.- Guiding High-Performance SAT Solvers with Unsat-Core Predictions.- Verifying Binarized Neural Networks by Angluin-Style Learning.- CrystalBall: Gazing in the Black Box of SAT Solving.- Clausal Abstraction for DQBF.- On Super Strong ETH.

---