The version of slides is often the latest version of the talk.
A Theory for Computing with SAT Solvers: What's the Power of a Satisfying Assignment? [pdf]
IIT Bombay Dec 2023
IIT Delhi Jan 2024
University of Toronto Feb 2024
Constrained Optimization over Semirings [pdf]
| Video:[youtube]
Simons Institute for Theory of Computing Nov 2023
Distribution Testing: The New Frontier for Formal Methods [pdf]
SAT SMT Winter School Dec 2023
FMCAD, Invited Talk Oct 2023
Distinct Elements in Streams: An Algorithm for the (Text) Book [pdf]
| Video:[youtube]
Georgia Institute of Technology Feb 2024
Tata Institute of Fundamental Research Nov 2023
University of Toronto Oct 2023
ENS PSL July 2023
CRIL Lens July 2023
Microsoft Research, Redmond June 2023
UC Santa Cruz May 2023
Stanford Software Research Lunch May 2023
Arizona State University May 2023
University of Massachusetts, Amherst May 2023
Northeastern University May 2023
CS Conversations, Simons Institute Apr 2023
IIT Bombay March 2023
National University of Singapore, Theory Seminar Nov 2022
MIAO Seminar, University of Copenhagen Sep 2021
Model Counting meets F0 Estimation [pdf]
| Video:[youtube]
Simons Institute for Theory of Computing October 2023
University of California, Berkeley EECS Seminar May 2023
University of Birmingham April 2022
IIT Bombay Feb 2022
IIT Kharagpur Nov 2021
TU Wien Oct 2021
Approximate Counting and Sampling [pdf]
| Video:[youtube]
Simons Institute: Bootcamp for Program on Satisfiability Feb 2021
Designing Samplers is Easy: The Boon of Testers [pdf]
| Video:[youtube]
Simons Institute, UC Berkeley April 2023
Dagstuhl Seminar on Theory and Practice of Satisfiability October 2022
Functional Synthesis: An Ideal Meeting Ground for Formal Methods and Machine Learning [pdf]
| Video:[youtube]
Distinguished Lecture, UTSA Matrix AI Seminar Sep 2023
University of Southern California (USC), Dept of Computer Science May 2023
Dagstuhl Seminar: Logical Reasoning and Machine Learning: The Next Frontier June 2022
Simons Institute June 2022
TU Graz February 2022
University of Copenhagen September 2021
USC CCI-MHI Cyber-Physical Systems Seminar Apr 2021
University of Wisconsin Mar 2021
MPI-SWS, Germany Mar 2021
Waterloo ML+Logic Seminar Mar 2021
CITRIS People and Robots Seminar Mar 2021
Counting, Sampling, and Synthesis: The Quest for Scalability [pdf]
| Video:[youtube]
Georgia Institute of Technology Feb 2023
George Mason University Feb 2023
Indian Institute of Technology, Bombay Feb 2023
Open University, Israel Feb 2023
National University of Singapore Feb 2023
ACP Early Career Research Award Talk August 2022
IJCAI Early Career Spotlight July 2022
University of Toronto April 2022
University of Southern California April 2022
Pennsylvania State University April 2022
University of California, Berkeley Mar 2022
University of Waterloo Mar 2022
Columbia University Mar 2022
Washington State University in St. Louis Mar 2022
Rice University Mar 2022
Purdue University Mar 2022
Iowa State University Feb 2022
University of Nebraska, Lincoln Feb 2022
CISPA Helmholtz Center for Information Security Feb 2022
Democratizing SAT Solving [pdf]
The Workshop on Democratizing Software Verification August 2022
Distribution Testing and Probabilistic Programming: A Match made in Heaven [pdf]
The Workshop on Verification of Probabilistic Programs August 2022
NP? No Problems! An invitation to the world of Formal Methods [pdf]
| Video:[youtube]
IIT Bombay CSE Research Symposium March 2023
The Rise of Model Counting: A Child of SAT Revolution [pdf]
MPI Software and Privacy Sep 2021
Data and Knowledge Seminar, University of Oxford Apr 2021
Keynote, Symposium on Dependable Software Engineering Theories, Tools and Applications Nov 2019
Sparse Hashing for Scalable Approximate Model Counting: When Theory and Practice Finally Meet [pdf]
| Video:[youtube]
UnRAVeL, RWTH Aachen Dec 2020
Model counting with probabilistic component caching [pdf]
University of Copenhagen Oct 2020
Constrained Counting and Sampling: From Theory to Practice and Back [pdf]
Keynote, 26th International SPIN Symposium on Model Checking of Software July 2019
Tata Research Development and Design Centre Dec 2016
Towards Verifying AI Systems: Testing of Uniform Samplers [pdf]
Rutgers University Feb 2020
Institute of Theoretical Computer Science, Shanghai Nov 2019
East China Normal University Nov 2019
University of Toronto Aug 2019
Tata Institute of Fundamental Research Jun 2019
MPS-SWS May 2019
IST Austria May 2019
The second Workshop of Formal Methods and AI (FMAI) May 2019
Rice University Feb 2019
Indian Institute of Technology, Bombay Jan 2019
Formal Methods and AI: Yet Another Entanglement [pdf]
Waterloo ML + Security + Verification Workshop Aug 2019
CrystalBall: Gazing into the Future of SAT Solving [pdf]
Dagstuhl Seminar: Logical Reasoning and Machine Learning: The Next Frontier July 2022
Rice University Sep 2019
Defense Service Organization Mar 2019
The Third Indian SAT+SMT School, IIIT Hyderabad Dec 2018
Indian Institute of Technology, Delhi Sep 2018
Theory and Practice of Satisfiability Solving at Casa Mathematica Oaxaca Aug 2018
Beyond NP Revolution [pdf]
ShanghaiTech University Nov 2019
University of Helsinki Nov 2019
Yale University Oct 2019
Chinese Academy of Sciences Jul 2019
TCS, KTH Royal Institute of Technology May 2019
CRIL-CNRS, Lens May 2019
Telekom-ParisTech May 2019
TU Dresden Apr 2019
Singapore Management University Mar 2019
IIT Kharagpur Mar 2019
Indian Statistical Institute, Kolkota Feb 2019
Complexity, Algorithms, Automata and Logic Meet (CAALM), Chennai Jan 2019
IIT Hyderabad Dec 2018
Singapore University of Technology and Design Oct 2018
DSO National Laboratories, Singapore Jul 2018
Leiden University, Netherlands Jul 2018
INRIA Rennes, France Jun 2018
The Second Coming of Logic in AI [pdf]
Yogyakarta, Indonesia Mar 2018
On Demystifying CNF-XOR Formulas
Indian Institute of Technology, Delhi Aug 2017
Constrained Counting and Sampling: Bridging the gap between Theory and Practice [pdf]
Indian Institute of Science, Bangalore Dec 2017
Iowa State University Apr 2017
Rutgers University Apr 2017
New York University Apr 2017
University of Utah Mar 2017
Virginia Tech Mar 2017
Purdue Mar 2017
Arizona State University Mar 2017
IST Austria Mar 2017
MPI-SWS, Germany Mar 2017
University of Waterloo Mar 2017
National University of Singapore Feb 2017
Institute of Theoretical Computer Science, Shanghai Feb 2017
IIT Delhi Jan 2017
IIT Kanpur Jan 2017
IIT Bombay Jan 2017
Tata Institute of Fundamental Research Jan 2017
Chennai Mathematical Institute Jan 2017
IIT Madras Jan 2017
The First Indian SAT+SMT School Dec 2016
Improving Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Solver Calls [pdf]
Fields Institute, Workshop on Theoretical Foundations of SAT Solving August 2016
Constrained Sampling and Counting: When Practice Drives Theory [pdf]
Chennai Mathemtical Institute Jan 2016
Theory Seminar, Hebrew University of Jerusalem Dec 2015
Scalable Techniques for Constrained Sampling and Counting. [pdf]
IBM Research, Haifa Dec 2015
Designing Scalable Techniques for Dynamic Verification and Probabilistic Inference [pdf]
IBM Research, Bangalore Aug 2015
SAT Sampling and Counting: From Theory to Practice [pdf]
Vienna Center of Logic and Algorithms Outstanding Masters' Thesis Award Ceremony May 2015
Word-Level Hashing Approach to Approximate Probabilistic Inference [pdf]
University of California, Berkeley Feb 2016
Sampling from combinatorial spaces: Achieving the fine balancing act between independence and scalability [pdf]
| Video:[youtube]
Approximating probabilistic inference without losing guarantees: Combining hashing with feasibility [pdf]
Sampling techniques for constraint satisfaction and beyond [pdf]
| Video:[youtube]
Princeton University June 2014
University of California, Berkeley June 2014
Microsoft Research India, Bangalore June 2014
Mentor Graphics Inc. May 2014
Distribution-aware sampling for SAT and beyond [pdf]
IIT Bombay Jan 2014
Synopsys Inc. Dec 2013
Automated Synthesis: Towards the Holy Grail of AI
[Website] Co-presented with S. Akshay, Supratik Chakraborty, Priyanka Golia, and Subhajit Roy International Joint Conference on Artificial Intelligence (IJCAI 2022) AAAI Conference on Artificial Intelligence (AAAI 2022)
The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT
[Slides]
[Tutorial Video] Simons Institute Workshop on Beyond Satisfiability, 2021
Logic-Enabled Verification and Explanation of ML Models
[Website] Co-presented with Alexey Ignatiev, Joao Marques-Silva, and Nina Narodytska International Joint Conference on Artificial Intelligence (IJCAI 2020, held in Jan 2021)
Rigorous Verification and Explanation of ML Models
[Website] Co-presented with Alexey Ignatiev, Joao Marques-Silva, and Nina Narodytska AAAI Conference on Artificial Intelligence (AAAI 2020)
Scaling Discrete Integration and Sampling: Foundations and Challenges
[Slides] Co-presented with Supratik Chakraborty International Joint Conference on Artificial Intelligence (IJCAI 2018)
Discrete Sampling and Integration for the AI Practitioner
[Slides]
Co-presented with Supratik Chakraborty and Moshe Y. Vardi AAAI Conference on Artificial Intelligence (AAAI 2017)
Discrete Sampling and Integration in High Dimensional Spaces
[Slides]
[Tutorial Video] Co-Presented with Supratik Chakraborty and Moshe Y. Vardi Conference on Uncertainity in Artificial Intelligence (UAI 2016)
I often teach the entire class using whiteboard/blackboard, and therefore, the lecture notes for most of the classes are still missing. But I am determined to convert them into LaTeX/Markdown one day.
CSC2512: Advanced Propositional Reasoning (Fall 2023)
CS 3243: Introduction to Artificial Intelligence (Fall 2020; Fall 2021); Lecture Notes: [html]
CS 4244: Knowledge Representation and Reasoning (Spring 2021; Spring 2020; Spring 2019; Spring 2018)
CS 4269/5469: Fundamentals of Logic in Computer Science (Fall 2019)
CS 6283: Advanced Topics in Computer Science: Logic in AI (Fall 2018)