ScopePermalink

SAT 2025 is the 28th edition of the International Conference on Theory and Applications of Satisfiability Testing. The scope of SAT 2025 includes all aspects of the theory and applications of propositional satisfiability broadly construed. This includes paradigms such as Boolean optimization using, e.g., MaxSAT and pseudo-Boolean (PB) solving, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), model counting, constraint programming (CP), and integer linear programming (ILP) for problems with clear connections to Boolean-level reasoning. This year the 31st International Conference on Principles and Practice of Constraint Programming (CP) will be co-located with SAT and will have deadlines and reviewing process synchronized with SAT 2025.

Topics of interest for the SAT 2025 conference include but are not limited to:

    Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues)
    Practical search algorithms
    Knowledge compilation
    Implementation-level details of SAT and SMT solving tools and SAT/SMT-based systems
    Problem encodings and reformulations
    Applications (including both novel applications domains and improvements to existing approaches)
    Case studies and reports on scientific findings based on rigorous experimentation

Out of ScopePermalink

Papers claiming to resolve significant long-standing open problems in mathematics or computer science (such as those for which a Millennium Prize is offered) are outside the scope of the conference, since there is insufficient time in the schedule to referee such papers. Instead, works of such importance should be submitted to an appropriate scientific journal for in-depth technical review.