BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1650
DTSTAMP:20260128T041645Z
SUMMARY:Quantified CDCL and Dependency Schemes: A proof-theoretic study
DESCRIPTION:Speaker: Meena Mahajan (Institute of Mathematical Sciences (I.M
 .Sc.))\n\nAbstract: \nIn Quantified Boolean Formulas (QBFs)\, dependency s
 chemes help identify spurious or superfluous variable dependencies introdu
 ced by the quantifier prefix but not essential for constructing countermod
 els. Detecting such dependencies can provably shorten refutations in certa
 in proof systems and is expected to improve the performance of QBF solvers
 . Among the most prominent solving techniques for QBFs is Quantified Confl
 ict-Driven Clause Learning\, a generalization of CDCL to the quantified se
 tting. The QCDCL proof system provides an abstract framework that captures
  the reasoning employed by such solvers.  In this talk\, I will describe 
 how dependency schemes can be incorporated into QCDCL-based proof systems 
 in various phases: during preprocessing\, in the decision heuristics\, or 
 within propagation and learning.\nBased on joint work with Abhimanyu Choud
 hury.\nShort Bio: Meena Mahajan is a professor at The Institute of Mathema
 tical Sciences\, HBNI\, Chennai\, India. Her interests span several sub-a
 reas within theoretical computer science. Her research focusses primarily
  on understanding the limits of efficient computation\, and encompasses m
 any aspects of complexity theory\, including Boolean function complexity\
 , algebraic circuits\, and proof complexity. https://www.imsc.res.in/~mee
 na\n
URL:https://www.tcs.tifr.res.in/web/events/1650
DTSTART;TZID=Asia/Kolkata:20260203T160000
DTEND;TZID=Asia/Kolkata:20260203T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR