Scope

SAT is the premier annual meeting for researchers focusing on the theory and applications of propositional satisfiability, broadly construed. That includes Boolean optimization, such as MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), model counting, and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Topics of interest 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 solving tools and SAT-based systems
    Problem encodings and reformulations
    Applications (including both novel applications domains and improvements to existing approaches)
    Case studies and reports on insightful findings based on rigorous experimentation

Out of Scope

Papers claiming to resolve a major long-standing open theoretical question in Mathematics or Computer Science (such as those for which a Millennium Prize is offered), are outside the scope of the conference because there is insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal.

Paper Categories

Submissions to SAT 2026 are invited in the following three categories:

    Long papers (9 to 15 pages, excluding references and appendices)
    Short papers (up to 8 pages, excluding references and appendices)
    Tool papers (up to 8 pages, excluding references and appendices)

Long and short papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementation available with the submission. Submissions on applications and case studies are encouraged. Such papers should describe details, weaknesses and strengths of the proposed approaches in sufficient depth, but they are not expected to introduce novel solving methods.

Long and short papers will be evaluated with the same quality standards, and are expected to contain a similar contribution per page ratio. The authors should choose between a long or a short paper depending on the space they need to fully describe their contribution. The classification between long and short papers impacts the duration of the presentation of the work during the conference. It is the responsibility of the authors to make sure that their paper is self-contained in the chosen limit of pages. Reviewers are not required to read appendices. There will be no re-classification of the submissions by the PC.

Tool papers are expected to report on the design and implementation of a tool and its novel features. Here “tool” is interpreted in a broad sense, including descriptions of solvers, preprocessors, etc., as well as systems that exploit SAT solvers or their extensions for use in a relevant problem domain. It is expected that a tool paper is accompanied by a publicly available artifact with a usage description or manual. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool.