\n

The Inter national Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory an d applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boo lean optimization (such as MaxSAT and Pseudo-Boole an (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and C onstraint Programming (CP) for problems with clear connections to Boolean-level reasoning.

\n\nDue to the current circumstances regarding the COVID-19 pandemic outbreak, the conference program chairs have decided to hold SAT 2020 as a fully v irtual conference which will be held from 3 to 10 July 2020.

\n

URL:http://sat2020.idea-researchlab.org/
CONTACT:sat2020 at easychair.org
END:VEVENT
END:VCALENDAR
SAT 2020 welcomes scientific contributions addressing different aspe cts of the satisfiability problem, interpreted in a broad sense. Topics include, but are not restric ted to: Theoretical advances, Practical search alg orithms, Knowledge compilation, Implementation-lev el details of SAT solving tools, Problem encodings and reformulations, Applications, and Case studie s based on rigorous experimentation.

\n\nS ubmissions to SAT 2020 are solicited in three cate gories, describing original contributions: Long pa pers (9 to 15 pages, excluding references), Short papers (up to 8 pages, excluding references) and T ool papers (up to 6 pages, excluding references).< /p>