BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/940
DTSTAMP:20230914T125944Z
SUMMARY:Building strategies into QBF proofs
DESCRIPTION:Speaker: Meena Mahajan (The Institute of Mathematical Sciences\
 nCIT Campus\, Chennai)\n\nAbstract: \nQuantified Boolean Formulas (QBF) ar
 e a natural extension of the SAT problem\, with more sophisticated semanti
 cs: functions witnessing the truth of a QBF can be interpreted as strategi
 es in a two-player game. A lot has been written regarding the extraction o
 f strategies from QBF proofs\, in various proof systems. Here we devise a 
 new system - Merge Resolution - in which strategies are built explicitly w
 ithin the proofs themselves. We investigate some advantages of Merge Resol
 ution over existing systems\; in particular\, we find that it lifts natura
 lly to DQBF\, a further extension of QBF.\nJoint work with Olaf Beyersdorf
 f and Joshua Blinkhorn. To appear in STACS 2019.\n
URL:https://www.tcs.tifr.res.in/web/events/940
DTSTART;TZID=Asia/Kolkata:20190215T153000
DTEND;TZID=Asia/Kolkata:20190215T163000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR