\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\n

URL:http://sat2020.idea-researchlab.org/
CONTACT:sat2020 at easychair.org
END:VEVENT
END:VCALENDAR
SAT 2020 welcome s scientific contributions addressing different as pects of the satisfiability problem, interpreted i n a broad sense. Topics include, but are not restr icted to: Theoretical advances, Practical search a lgorithms, Knowledge compilation, Implementation-l evel details of SAT solving tools, Problem encodin gs and reformulations, Applications, and Case stud ies based on rigorous experimentation.

\n\nSubmissions to SAT 2020 are solicited in three ca tegories, describing original contributions: Long papers (9 to 15 pages, excluding references), Shor t papers (up to 8 pages, excluding references) and Tool papers (up to 6 pages, excluding references) .

\n