BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69b2efc1bfcd7
DTSTART;TZID=America/Toronto:20180904T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180904T123000
URL:https://uwaterloo.ca/artificial-intelligence-group/events/phd-defence-r
 elationship-between-satisfiability-and
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2310 Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Defence: On the Relationship Between Satisfiability and Partial
 ly\nObservable Markov Decision Processes
CLASS:PUBLIC
DESCRIPTION:Ricardo Salmon\, PhD candidate\nDavid R. Cheriton School of Com
 puter Science\n\nStochastic satisfiability (SSAT)\, Quantified Boolean Sat
 isfiability\n(QBF) and decision theoretic planning in infinite horizon par
 tially\nobservable Markov decision processes (POMDPs) are all PSPACE-Compl
 ete\nproblems. Since they are all complete for the same complexity class\,
  I\nshow how to convert them into one another in polynomial time and\nspac
 e.
DTSTAMP:20260312T165425Z
END:VEVENT
END:VCALENDAR