BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/743
DTSTAMP:20230914T125936Z
SUMMARY:Constrained Counting and Sampling: Bridging the Gap between Theory
and Practice
DESCRIPTION:Speaker: Kuldeep S. Meel (Rice University\nDepartment of Comput
er Science\nDH 3060 Duncan Hall\n6100 S. Main Street\nHouston\, TX 77005\n
United States of America)\n\nAbstract: \nConstrained counting and sampling
are two fundamental problems in Computer Science with numerous applicatio
ns\, including network reliability\, decision making under certainty\, pro
babilistic reasoning\, and constrained-random verification. In constrained
counting\, the task is to compute the total weight\, subject to a given w
eighting function\, of the set of solutions of the given constraints. In c
onstrained sampling\, the task is to sample randomly\, subject to a given
weighting function\, from the set of solutions to a set of given constrain
ts.\n\nIn this talk\, I will introduce a novel algorithmic framework for c
onstrained sampling and counting that combines the classical algorithmic t
echnique of universal hashing with the dramatic progress made in Boolean r
easoning over the past two decades. This has allowed us to obtain breakt
hrough results in constrained sampling and counting\, providing a new algo
rithmic toolbox in design verification\, machine learning\, probabilistic
reasoning\, and the like. I will demonstrate the utility of the above te
chniques on various real applications including probabilistic inference\,
hardware verification\, and our ongoing collaboration in estimating the re
liability of critical infrastructure networks during natural disasters.\n\
nBio: Kuldeep Meel is a final year Ph.D. candidate at Rice University work
ing with Prof. Moshe Vardi and Prof. Supratik Chakraborty (IITB). He obtai
ned a B.Tech. from IIT Bombay and an M.S. from Rice in 2012 and 2014 respe
ctively. His research broadly lies at the intersection of artificial intel
ligence and formal methods. He is the recipient of a 2016-17 IBM Ph.D. Fel
lowship\, the 2016-17 Lodieska Stockbridge Vaughn Fellowship\, and the 201
3-14 Andrew Ladd Fellowship. His research won the best student paper award
at the International Conference on Constraint Programming 2015. He co-w
on the 2014 Vienna Center of Logic and Algorithms International Outstandin
g Masters Thesis Award.\n
URL:https://www.tcs.tifr.res.in/web/events/743
DTSTART;TZID=Asia/Kolkata:20170111T110000
DTEND;TZID=Asia/Kolkata:20170111T123000
LOCATION:AG-80
END:VEVENT
END:VCALENDAR