| 2025 | 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 Jeremias Berg, Jakob Nordström |
| 2025 | An Algebraic Approach to MaxCSP. Ilario Bonacina, Jordi Levy |
| 2025 | An Application of SAT Solvers in Integer Programming Games. Pravesh Koirala, Aditya Shrey, Forrest Laine |
| 2025 | Analyzing Reformulation Performance in Core-Guided MaxSAT Solving. André Schidler, Stefan Szeider |
| 2025 | Anytime and Exact Search for Planning Problems: How to Explore a DP-based State Transition Graph with A*, CP and LS? (Invited Talk). Christine Solnon |
| 2025 | Better Extension Variables in DQBF via Independence. Leroy Chew, Tomás Peitl |
| 2025 | Bit-Precise Reasoning with Parametric Bit-Vectors. Zvika Berger, Yoni Zohar, Aina Niemetz, Mathias Preiner, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli |
| 2025 | Bridging Language Models and Symbolic Solvers via the Model Context Protocol. Stefan Szeider |
| 2025 | CNFs and DNFs with Exactly k Solutions. L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel |
| 2025 | CNOT-Optimal Clifford Synthesis as SAT. Irfansha Shaik, Jaco van de Pol |
| 2025 | Certifying Projected Knowledge Compilation. Randal E. Bryant, Yong Kiam Tan, Marijn J. H. Heule |
| 2025 | Core-Guided Linear Programming-Based Maximum Satisfiability. George Katsirelos |
| 2025 | Depth-Optimal Quantum Layout Synthesis as SAT. Anna Blume Jakobsen, Anders B. Clausen, Jaco van de Pol, Irfansha Shaik |
| 2025 | Efficient Certified Reasoning for Binarized Neural Networks. Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen, Kuldeep S. Meel |
| 2025 | Enumerating All Boolean Matches. Alexander Nadel, Yogev Shalmon |
| 2025 | Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis. Orestis Lomis, Jo Devriendt, Hendrik Bierlee, Tias Guns |
| 2025 | Learn to Unlearn. Bernhard Gstrein, Florian Pollitt, André Schidler, Mathias Fleury, Armin Biere |
| 2025 | On Top-Down Pseudo-Boolean Model Counting. Suwei Yang, Yong Lai, Kuldeep S. Meel |
| 2025 | Privacy-Preserving SAT Solving (Invited Talk). Ruzica Piskac |
| 2025 | Problem Partitioning via Proof Prefixes. Zachary Battleman, Joseph E. Reeves, Marijn J. H. Heule |
| 2025 | QRP+Gen: A Framework for Checking Q-Resolution Proofs with Generalized Axioms. Mark Peyrer, Martina Seidl |
| 2025 | Random Local Access for Sampling k-SAT Solutions. Dingding Dong, Nitya Mani |
| 2025 | Redundancy Rules for MaxSAT. Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria |
| 2025 | Reencoding Unique Literal Clauses. Aeacus Sheng, Joseph E. Reeves, Marijn J. H. Heule |
| 2025 | RustSAT: A Library for SAT Solving in Rust. Christoph Jabs |
| 2025 | SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura |
| 2025 | SAT-Metropolis: Combining Markov Chain Monte Carlo with SAT/SMT Sampling. Maja Aaslyng Dall, Raúl Pardo, Thomas Lumley, Andrzej Wasowski |
| 2025 | Scalable Precise Computation of Shannon Entropy. Yong Lai, Haolong Tong, Zhenghang Xu, Minghao Yin |
| 2025 | Semi-Algebraic Proof Systems for QBF. Olaf Beyersdorff, Ilario Bonacina, Kaspar Kasche, Meena Mahajan, Luc Nicolas Spachmann |
| 2025 | Streamlining Distributed SAT Solver Design. Dominik Schreiber, Niccolò Rigi-Luperti, Armin Biere |
| 2025 | Symbolic Conflict Analysis in Pseudo-Boolean Optimization. Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao |
| 2025 | Towards Practical First-Order Model Counting. Ananth K. Kidambi, Guramrit Singh, Paulius Dilkas, Kuldeep S. Meel |