BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2020/newsitem/11366/3-
 --10-July-2020-23rd-International-Conference-on-Th
 eory-and-Applications-of-Satisfiability-Testing-SA
 T-2020-Virtual
DTSTAMP:20200618T144404
SUMMARY:23rd International Conference on Theory an
 d Applications of Satisfiability Testing (SAT 2020
 ), Virtual
DTSTART;VALUE=DATE:20200703
DTEND;VALUE=DATE:20200710
LOCATION:Virtual
DESCRIPTION:The International Conference on Theory
  and Applications of Satisfiability Testing (SAT) 
 is the premier annual meeting for researchers focu
 sing on the theory and applications of the proposi
 tional satisfiability problem, broadly construed. 
 In addition to plain propositional satisfiability,
  it also includes Boolean optimization (such as Ma
 xSAT and Pseudo-Boolean (PB) constraints), Quantif
 ied Boolean Formulas (QBF), Satisfiability Modulo 
 Theories (SMT), and Constraint Programming (CP) fo
 r problems with clear connections to Boolean-level
  reasoning.  Due to the current circumstances rega
 rding the COVID-19 pandemic outbreak, the conferen
 ce program chairs have decided to hold SAT 2020 as
  a fully virtual conference which will be held fro
 m 3 to 10 July 2020.  SAT 2020 welcomes scientific
  contributions addressing different aspects of the
  satisfiability problem, interpreted in a broad se
 nse. Topics include, but are not restricted to: Th
 eoretical advances, Practical search algorithms, K
 nowledge compilation, Implementation-level details
  of SAT solving tools, Problem encodings and refor
 mulations, Applications, and Case studies based on
  rigorous experimentation.  Submissions to SAT 202
 0 are solicited in three categories, describing or
 iginal contributions: Long papers (9 to 15 pages, 
 excluding references), Short papers (up to 8 pages
 , excluding references) and Tool papers (up to 6 p
 ages, excluding references).
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>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.</p>\n\n  
 <p>Due 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.</p>\n</div><div>\n  <p>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.</p>\n\n  <p
 >Submissions 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)
 .</p>\n</div>
URL:http://sat2020.idea-researchlab.org/
CONTACT:sat2020 at easychair.org
END:VEVENT
END:VCALENDAR