Four of my advisees were in job market this past academic year and all of them managed to secure tenure-track positions in four countries across three continents. Congratulations!

1. Teodora Baluta (PhD, co-advised with Prateek Saxena) will be joining Georgia Tech as an Assistant Professor.
   
2. Gunjan Kumar (post-doc, co-advised with Diptarka Chakraborty) will be joining IIT Kanpur as an Assistant Professor.
   
3. Anna Latour (post-doc) will be joining TU Delft as an Assistant Professor.
   
4. Tim van Bremen (post-doc) will be joining Nanyang Technical University (NTU) Singapore as an Assistant Professor.

Our paper characterizing the complexity of total variation distance estimation and probabilistic inference is accepted to ICML 2024. Our paper shows that estimating TV distance admits FPRAS if the underlying inference queries can be performed in polynomial time.

Our paper on engineereing an efficient preprocessor for model counting is accepted to DAC 2024. Joint work with Mate Soos.

We have two papers accepted to PODS-24.

1. The first paper, co-authored with Sourav Chakraborty]sourav and Umang Mathur presents a faster FPRAS for counting the number of words accepted by NFA.

2. The second paper, co-authored with Pavan Aduri,Sourav Chakraborty, and N.V. Vinodchandran introduces the model of right to be forgotten in the context of streaming.

Four papers accepted to AAAI-24.

The first paper, co-authored with S. Akshay and Supratik Chakraborty, focuses on auditable model counting.

The second paper , co-authored with my PhD student, Suwei Yang, proposes an exact model counter of PB constraints.

The third paper, co-authored with Mahi Kabir (my PhD student), and Supratik Chakraborty (my PhD advisor!) focuses on ASP model counting.

The fourth paper, co-authored with Arijit Shaw (my PhD student) and Brendan Juba focuses on Skolem function counting.

Our paper on exploring limits of approximability for query evaluation in probabilistic graphs is accepted to ICDT24. Joint work with Antoine Amarilli and Tim van Bremen.

I will be talking about our work on constrained optimization over semirings at Simons Institute’s Logic and Algebra for Query Evaluation.

I will be giving a keynote talk at FMCAD-23 on distribution testing and formal methods

I will be talking about our work on counting and streaming at Simons Institute’s Workshop on Probabilistic Circuits and Logic.

Our IJCAI23 paper on the complexity of total variation distance is featured on Oded Goldreich’s choices.

Our CAV paper received Distinguished Paper Award. Joint work with Jiong Yang.

Don Knuth talked about our algorithm: for distinct element estimation at Stanford theory seminar. He has also posted an article on the algorithm (well, it should be called KCVM).

Our paper on using causal reasoning for SAT solving is accepted to SAT-23.

Our paper on latest advance to ApproxMC based on rounding of computations is accepted to CAV-23. Joint work with Jiong Yang

A memorable evening: Dinner with Don Knuth.

Our paper on search vs decision oracle for approximate model counting is accepted to ICALP-23. Joint work with Diptarka Chakraborty, Sourav Chakraborty, and Gunjan Kumar.

Three Papers accepted to IJCAI-23

The first paper focuses on identifying set codes; we discuss a new approach based on independent support. Joint work with Anna Latour and Arun Sen.

The second paper focuses on Approximate DNF counting, which builds on our recent work in streaming. Joint work with Mate Soos, Divesh Aggarwal, Sourav Chakraborty, and Maciej Obremski.

The third paper focuses on the complexity of approximating total variation distance. Joint work with Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S Meel, Dimitrios Myrisiotis, Pavan A. and N. V. Vinodchandran.

Our paper on Computing Fairness Influence Functions is accepted to FaaCT-23. Joint work with Bishwamittra Ghosh and Debabrota Basu

Our paper on Probabilistic Query Complexity in Combined Complexity is accepted to PODS-23. Joint work with Timothy van Bremen

Our paper on “Testing Horn Samplers” is accepted to AISTATS-23. The paper is co-authored with Anshuman Banerjee, Sourav Chakraborty, Uddalok Sarkar, and Sayantan Sen.

Our paper on synthesis with explicit dependencies is accepted to DATE-23. The paper also received Best Paper Award Candidate nomination. Co-authored with Priyanka Golia and Subhajit Roy. Priyanka is on on academic job market.

Two papers accepted to AAAI-23. The first paper, co-authored with Pavan Aduri, N.V. Vinodchandran, and Arnab Bhattacharyya, focuses on constraint optimization over semirings. The second paper, co-authored with Yong Lai and Roland Yap, focuses on fast converging model counting.

Our work on testing of samplers is accepted to NeurIPS-22. Joint work with Yash Pote.

Had great fun co-organizing Vardifest.

Traveling from Vienna to Haifa, Israel for two weeks of FLoC.

Traveling to Vienna for IJCAI-22. We will be presenting tutorial on functional synthesis and I will be giving a talk at IJCAI-22 Early Career Spotlight session.

On way to Dagstuhl for seminar on logical reasoning and machine learning. I will be giving two talks: the first is on crystalball and second is on manthan.

Our work on independent support computation is accepted to ICCAD-22. Joint work with Mate Soos.

Our work on incremental weighted sampling is accepted to FMCAD 2022. Joint work with Suwei Yang.

Our work on projected model counting is accepted to ATVA 2022. Joint work with Jiong Yang and Supratik Chakraborty

Our work on distinct elements counting in a stream is accepted to ESA 2022. Joint work with Sourav Chakraborty and N.V. Vinodchandran

Our work on designing the first almost-uniform sampler for all epsilon > 0 is accepted to LICS-22 This is based on Masters thesis of Remi Delannoy.

Our work on Quantitative testing of samplers is accepted to CP 2022. Joint work with Mate Soos, Priyanka Golia, and Sourav Chakraborty.

Honored to receive 2022 NUS Annual Teaching Excellence Award. I am indebted to my mentors, TAs, and of course, my amazing students.

Invited to spotlight talk in the Early Career Spotlight Track at IJCAI-ECAI 2022

Our work on designing the first almost-uniform sampler for all epsilon > 0 is accepted to LICS-22 This is based on Masters thesis of Remi Delannoy.

Our work on computation of union of sets in streaming model is accepted to PODS-22. Joint work with Sourav Chakraborty and Vinod Varyam. This is a follow-up of our PODS-21 work.

Our paper “Efficient Learning of Interpretable Classification Rules” is accepted to JAIR journal. Joint work with Bishwamittra Ghosh and Dmitry Malioutov.

Our paper “A Scalable t-wise Coverage Estimator” is accepted to ICSE 2022. Joint work with Eduard Baranov, Sourav Chakraborty, Axel Legay, and N. V. Vinodchandran.

Three papers from our group were accepted to AAAI 2022.

1. Algorithmic Fairness Verification with Graphical Models (Joint work with Bishwamittra Ghosh and Debabrota Basu)

2. ApproxASP - A Scalable Approximate Answer Set Counter (Joint work with Mohimenul Kabir, Flavio Everardo, Ankit K Shukla, Markus Hecher, and Johannes Fichte)

3. Constraint-Driven Explanations for Black Box ML Models (Joint work with Aditya Shrotri, Nina Narodytska, Alexey Ignatiev, Joao Marques-Silva, and Moshe Y. Vardi)

Our ICCAD-21 paper received Best Paper Award Nomination at ICCAD-21.

Our paper (joint work with my PhD student, Yash Pote) “Testing Probabilistic Circuits” is accepted to NeurIPS 2021.

Congratulations to my PhD student Teodora Baluta for winning Google PhD Fellowship

Our PODS-21 paper received “Best of PODS 2021” mention and invited to ACM TODS.

Thank you Amazon Research Award for supporting our work on enabling GPU-enabled Parallel SAT solvers.

Our paper “Engineering an Efficient Boolean Functional Synthesis Engine” is accepted to ICCAD 2021. Joint work with Priyanka Golia, Friedrich Slivovsky, and Subhajit Roy.

Our paper “Designing Samplers is Easy: The Boon of Testers” is accepted to FMCAD-21. Joint work with Priyanka Golia, Mate Soos, and Sourav Chakraborty.

Our work on MaxSAT augmented with Guass Jordan Elimination is accepted to KR2021. Joint work with Mate Soos.

Our work on GPU-based Parallel SAT solving is accepted to SAT-21. Joint work with Nicolas Prevot and Mate Soos.

Our work on Program Synthesis via Dependency Quantified Boolean formulas is accepted to IJCAI-21. Joint work with Priyanka Golia and Subhajit Roy.

Our work on Counting Minimal Unsatisfiable Subsets is accepted to CAV-21. Joint work with Jaroslav Bendik.

Looking forward to speaking on the rise of model counting at Data and Knowledge Seminar at Oxford

Our survey paper on Partition Function Estimation is accepted to IJCAI-21 Survey Track. Joint work with Durgesh Agrawal and Yash Pote.

Looking forward to speaking on Formal Methods+Machine Learning at CCI MHI Seminars at USC

Our work on computation of union of sets in streaming model is accepted to PODS-21. Joint work with Sourav Chakraborty and Vinod Varyam.

Looking forward to virtual visit at MPI-SWS.

Looking forward to speaking on Formal Methods+Machine Learning at PL Seminar at University of Wisconsin.

Looking forward to speaking on Formal Methods+Machine Learning at Waterloo’s ML+Logic Seminar.

Our work on Linear Modular Arithmetic in CP is accepted to CPAIOR-21. Joint work with Gilles Pesant and Mahshid Mohammadalitajrishi

Our work on computation of union of sets in streaming model is accepted to PODS-21. Joint work with Sourav Chakraborty and Vinod Varyam.

I will present our work on synthesis at CITRIS People and Robotics seminar.

I will be giving an in-depth talk on the rise of approximate model counting at Simons Workshop on Beyond Satisfiability. Recorded video

An Introduction to Approximate Counting and Sampling at Simons Bootcamp for Program on Satisfiability.

Our CAV-20 paper received invitation to a special issue of the journal Formal Methods in System Design (FMSD) dedicated to the best papers from CAV 2020.

Join, from the comfort of your home, our tutorial on Logic-Enabled Verification and Explanation of ML Models at IJCAI-21.

Honored to be chosen among “AI’s 10 to Watch” by IEEE Intelligent Systems. I owe it to my amazing mentors and colleagues (particularly, my students) for the exciting collaborations all these years.

Our work on scalable quantitative verification for deep neural networks has been accepted to ICSE 2021.

All the five papers from our group were accepted to AAAI 2021.

1. Justicia: A Stochastic SAT Approach to Formally Verify Fairness
   (Joint work with Bishwamittra Ghosh and Debabrota Basu)

2. Predicting Forest Fire Using Remote Sensing Data And Machine Learning
   (Joint work with Authors: Suwei Yang, Massimo Lupascu)

3. Symmetric Component Caching for Model Counting on Structured Instances
   (Joint work with Timothy van Bremen, Vincent Derkinderen, Shubham Sharma, Subhajit Roy)

4. Counting Maximal Satisfiable Subsets
   (Joint work with Jaroslav Bendik)

5. The Power of Literal Equivalence in Model Counting
   (Joint work with Yong Lai and Roland Yap )

We will be virtually at NeurIPS the entire week.

1. The first paper focuses on efficient distance approximation in high dimension distributions. We propose an amazingly simple method that can compute L1 distance with rigorous guarantees. Come to Poster Session 5 on Thursday.
2. The second paper provides the first scalable method to test samplers in practice. Barbarik can now test samplers that sample from log-linear models. If you propose a sampling technique but can’t prove its correctness, you can now use Barbarik to check its quality. Just the way we use testing for our software. Come to Poster Session 6 on Friday. Joint work with S. Chakraborty and Y. Pote
3. The third paper seeks to tame discrete integration with the boon of dimensionality (Yes, the boon not the curse). We extended our IJCAI-15’s work of weighted to unweighted counting (thereby increasing the dimensionality) to handle rational weights. Come to Poster Session 6 on Friday.

Three Papers accepted to NeurIPS 2020.

1. The first paper titled, On Testing of Samplers, describes how to test samplers without exponentially many samles Authors: Kuldeep S Meel, Yash Pralhad Pote and Sourav Chakraborty
2. The second paper focuses on Taming Discrete Integration via the Boon of Dimensionality. Authors: Jeffrey M. Dudek, Dror Fried and Kuldeep S. Meel
3. The third paper focuses on Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning. Authors: Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel and N. V. Vinodchandran

Our Paper on Model Counting meets F0 Estimation (public version forthcoming!) is accepted to PODS 2021. Authors: Arnab Bhattacharyya, Kuldeep Meel, A. Pavan and N.V. Vinodchandran

We presented our work on Phase Transition Behaviour in Knowledge Compilation at CP 2020.

We will be presenting three papers at CAV 2020.

1. The first paper builds on our CNF-XOR solving paradigm (BIRD) and as a result, the new versions of ApproxMC and UniGen are faster than ever.
2. The second paper proposes the first algorithm for approximate MUS counting.
3. The third one proposes a data-driven approach for Boolean functional synthesis, which works at the intersection of constrained sampling, machine learning and automated reasoning.

This week at LICS, we will be presenting our work on Sparse XORs for Model Counting, resolving the long standing challenge of whether sparse XORs can be made to work in theory AND practice?

Our paper on phase transitions in knowledge compilation is accepted to CP 2020

We will be presenting two papers at SAT 2021. The first paper focuses on the usage of sparse XORs in approximate counting. The second paper introduces our new phase selection heuristic, called LSIDS.

Paper (joint work with Eduard Baranov and Axel Legay) “Baital: An Adaptive Weighted Sampling Approach for Improved t-wise Coverage” is accepted to FSE 2020.

Two papers accepted to SAT-2020 Conference.

The first paper (with my amazing interns Durgesh and Bhavishya) shows that the currently known bounds for sparse hashing are too weak to be used for algorithms such as ApproxMC. Our upcoming LICS Paper proposes new constructions for sparse hash functions to overcome this barrier.

The second paper (with my superstar current intern Arijit Shaw) proposes a new phase selection strategy for SAT solvers. Improving SAT solvers is just a very very hard job and we are excited about the improvements that our proposal brings to the world of SAT solving.

Paper (joint work with S. Akshay) on Sparse Hashing for Counting accepted to LICS 2020

And the notification came with the following review: “Rarely it is that there is a paper that proves a beautiful new theoretical result, explaining and simplifying previous work, and on top of that shows how it can be used to improve state-of-the-art practical algorithms. The paper “Sparse hashing for scalable approximate model counting: theory and practice” achieves exactly that. “

Our paper on formalization of Induction Models is accepted to LPAR-23. Co-authors: A Dileep and Ammar F. Sabili

Three Papers accepted at Computer Aided Verification (CAV) 2020 conference.

1. My outstanding PhD student, Priyanka Golia (jointly co-advised with Subhajit Roy), has proposed a new approach that combines sampling+machine learning+MaxSAT to achieve a significant breakthrough in solving Boolean Functional Synthesis. This has been technically the deepest project over the past two years, and I am extremely proud of Priyanka’s perseverance in tackling a problem that was first studied by George Boole.

2. The second paper, with ever-amazing Mate Soos and Stephan Gocht, builds on our CNF-XOR solving paradigm, and as a result, the new versions of ApproxMC and UniGen are faster than ever. Stay tuned for our releases.

3. The third paper, a fun collaboration with Jaroslav Bendik that owes to a “chance” meeting at one of the most fun conference I ever attended (LPAR22) presents the first algorithm for approximate MUS counting.

Our work on computation of union of sets in streaming model is accepted to PODS-21. Joint work with Sourav Chakraborty and Vinod Varyam.

Tutorial proposal on Explainability and Verification of AI systems accepted to IJCAI20

All the five papers from our group were accepted to AAAI 2021.

1. Justicia: A Stochastic SAT Approach to Formally Verify Fairness

   Authors: Bishwamittra Ghosh, Debabrota Basu, and Kuldeep S Meel

2. Predicting Forest Fire Using Remote Sensing Data And Machine Learning

   Authors: Suwei Yang, Massimo Lupascu, and Kuldeep S Meel

3. Symmetric Component Caching for Model Counting on Structured Instances

   Authors: Timothy van Bremen, Vincent Derkinderen, Shubham Sharma, Subhajit Roy, and Kuldeep S Meel

4. Counting Maximal Satisfiable Subsets

   Authors: Jaroslav Bendik and Kuldeep S. Meel

5. The Power of Literal Equivalence in Model Counting

   Authors: Yong Lai, Kuldeep S Meel, and Roland Yap

Co-presenting tutorial on Rigorous approaches for Explainability and Verification at AAAI20.

Our paper on Classification Rules in Relaxed Logical Form is accepted to ECAI 2020.

Our paper on Symmetry breaking and model counting is accepted to TACAS 2020.

Travling to Mumbai for the next two weeks. Co-organizing SAT SMT Winter School and spending another week as visiting faculty.

Looking forward to hosting Sourav Chakraborty this week at NUS.

I will be in Shanghai next week. Talks at Shanghai Tech on Nov 25, ECNU on Nov 26, ITCS Shanghai on Nov 27, and Keynote talk at SETTA 2019 on Nov 29. A busy week ahead. on Nov 21.

Our paper on Group Testing Via MaxSAT is accepted to AAAI 2020.

Teodora will be presenting our paper on Quantitative Verification of Neural Network at ACM CCS 2019.

Attending CP from Sep 30-Oct 4. Alexis will be presenting our work on unifying hashing-based approaches for discrete integration, and Bishwa will present on learning interpretable classifiers.

Our tutorial proposal on Logic-Enabled Verification and Explanation of ML Models is accepted to AAAI 2020 Tutorials on Sat, Feb 8.

Our Paper on embedding symbolic knowledge into Neural Networks is accepted to NeurIPS 2019.

Attending IJCAI from Aug 13-16. We will be presenting three papers: Phase Transition of CARD-XOR Constraints on Wed, DNF Counter on Thur, and New Exact counter on Fri.

Our NPAQ framework focused on providing PAC guarantees for verification of Neural Networks is accepted to CCS-19 Quoting reviewer: “This work is pioneering a new technique to solve an incredibly challenging problem, and it shows that smaller problem can be solved. I can live with that, future work can improve computational efficiency.”

Talk at Institute of Software, Chinese Academy of Sciences on Beyond NP Revoluion.

Giving keynote at SPIN-19 on Constrained Counting and Sampling.

Attending SAT from July 7-12. Our papers on CrystalBall framework and using model counting for principled diagnosis of machine learning explanation systems will be presented on Wednesday, July 9.

Paper with Alexis De Colnet demonstrating duality between different approaches to discrete integration has been accepted to CP 2019. The paper is based on Alexis’ Masters thesis and also his first paper. Congratulations Alexis!

Yang Suwei has been awarded Outstanding Undergraduate Researcher Prize (OURP) for his FYP project Computational Sustainability: Forest Fire Prediction in Indonesia, jointly co-advised with Prof. Massimo Lupascu (Department of Geography). Congratulations Suwei!

Visiting TIFR on June 20 and will be talking about our recent work on verifying AI systems.

Congratulations Rahul Gupta for defending Masters Thesis. Rahul’s thesis work resulted into our TACAS-19 paper.

Visiting IIT Bombay from June 6 to 20.

Congratulations Shubham for defending Masters Thesis. Shubham’s thesis resulted into LPAR-18 and IJCAI-19 papers.

Received notification of the award of NRF Fellowship for AI for the project: Provably Verified and Explainable Probabilistic Reasoning.

Two papers accepted to IJCAI. The first paper explores the phase transition behavior of conjunction of cardinality and XOR constraints. The second paper describes a radically new approach to exact counting wherein we compute estimates that are probabilistically exact! Combined with our invited paper on #DNF, this makes 3 papers that we will be presenting at IJCAI.

Leaving for a four week long Europe trip. Looking forward to meeting friends and colleagues at Telecom ParisTech, CRIL Lens, INRIA Rennes, IST Austria, KTH Stockholm, and MPI-SWS.

Our paper on counting-based approach for network reliability has been accepted to Reliability Engineering System Safety (RESS) journal.

Two papers accepted to SAT 2019. The first paper, co-authored with Mate Soos and Raghav Kulkarni, introduces the first version of CrystalBall, a framework intended to allow gazing into the black box of SAT solving. The second paper, co-authored with Nina Narodytska, Aditya Shrotri, Alexey Ignatiev, and Joao Marques Silva, discusses how model counting can be used to analyze explanations provided by tools such as ANCHOR.

Visiting TU Dresden tomorrow. Talk on Beyond NP Revolution at 1:30 PM.

Attending TACAS in Prague from April 6-11. Rahul Gupta will be presenting our WAPS paper.

Mate Soos will be presenting our paper on Bridging ANF and CNF solving at DATE 2019 on March 27. Checkout the accompanied tool Bosphorus.

Looking forward to my first visit to Singapore Management University on Friday, March 29. Talk title: Beyond NP Revolution.

Our CP 2018 paper on DNF counting is invited to IJCAI 2019 Sister Conference Best Papers Track. Thank you IJCAI!

Speaking at Defense Service Organization about our work on integration SAT solving and Machine Learning.

I am visting Indian Statistical Institute from Feb 27 to March 4. Looking forward to my first visit to Kolkata.

Honored to be appointed Visiting Assistant Professor in the Department of Computer Science and Engineering at IIT Bombay

Our paper on network reliability is accepted to The 13th International Conference on Applications of Statistics and Probability in Civil Engineering

Our paper on weighted and project sampling is accepted at TACAS 2019. Congratulations Rahul and Shubham.

Attending AAAI 2019 and AIES 2019 next week. Our group has four papers (3 at AAAI to be presented on Jan 30 and 31; the paper at AIES will be presented on Jan 27).

I will be speaking at CAALM workshop next week. Talk title: “Beyond NP Revolution”.

Back to Singapore and looking forward to the research week featuring so many interesting speakers.

I am teaching CS 4244: Knowledge Representation and Reasoning. Looking forward to the start of the semester.

Our paper on interpretable classification rules is accepted for publication at AIES 2019. Congratulations Bishwa on his first paper during PhD!

Paper on bridging ANF (Algebraic Normal Form) and CNF (Conjunctive Normal Form) is accepted for publication at DATE 2019. Jointly co-authored with Mate Soos, Davin Choo, and Kian Ming A. Chai.

Visiting IIT Bombay from Dec 18 – Jan 6. Even after all these years, I still get goosebumps thinking about visiting IITB.

I am visiting Hyderabad from Dec 5 – 9, 2018. Talk at IIT Hyderabad on Dec 5 and talk at SAT-SMT School on Dec 6. Looking forward to my favoriate end of year event.

The next version of ApproxMC is here: ApproxMC3 is faster and better than ever before. Do read Mate’s post for quick synopsys of the magic sauce behind ApproxMC’s performance.

Paper on bridging ANF (Algebraic Normal Form) and CNF (Conjunctive Normal Form) is accepted for publication at DATE 2019. Jointly co-authored with Mate Soos, Davin Choo, and Kian Ming A. Chai.

Awarded Distinguished Program Committee Member for IJCAI 2018.

3 Papers accepted at AAAI-19. The first paper, with Mate Soos, describes a new architecture for CNF-XOR formulas, which has allowed us to have a new approximate counter that is at least 100 times faster than ApproxMC2 – credit to Mate Soos for his breakthrough engineering that enabled this project! The second paper, with Sourav Chakraborty, proposes the first algorithmic framework to test the distribution of a sampler. We show that several samplers output distributions far from what they claim!
The third paper, with Supratik Chakraborty and Moshe Vardi, shows that several relaxations of probabilsitic inference do not give any computational advantage, raising concerns about the motivations behind their usage.

Supratik Chakraborty has been awarded the IITB research award to recognize sustained work on a particular theme of research: constrained counting and sampling. Congratulations!

Upcoming talk at SUTD on Tuesday (23 Oct).

Our paper on uniform sampling and knowledge compilation is accepted at LPAR. Congratulations Shubham Sharma and Rahul Gupta on their first paper!

I am visiting IIT Delhi from Sep 21 to Oct 2. Will introduce our latest project on understanding SAT solvers in Seminar on Sep 26.

We will be presenting three papers at CP 2018. The first talk on network reliability is on Monday 27th Aug while the second talk on FPRAS for DNF is on Wed, 29th Aug. The third talk on interpretable classification rules is on Thursday, 30th Aug.

Abstract “A Weighted Model Counting Method for Network Reliability Estimation” is accepted at ICASP13

PhD Thesis is awarded Honorable mention (i.e., runner-up) for 2018 ACP Doctoral Dissertation Award.

I am deeply honored to be appointed Sung Kah Kay Assistant Professor at School of Computing. The chair is established in the memory of Dr. Sung Kah Kay, who (with his wife, Jennifer Loo) passed away in Singapore Airlines crash in Taipei in 2000. Quoting Dr. Sung Kah Kay’s parents, who along with friends established the chair: “To us, it was a meaningful way of making our memory of Kah Kay come alive. His untimely departure was a great loss to us. But besides our loss, Kah Kay’s own loss was his unfulfilled dream of computer research work which was his life and passion”. I am thankful and honored to have been entrusted to contribute to Kah-Kay’s dream.

I will be at IJCAI from July 12 – July 19 and at Leiden University on July 20. I will be co-presenting tutorial with Supratik Chakraborty at IJCAI on July 13.

I am visiting MPI-SWS and INRIA Rennes for the next two weeks (i.e. June 16 – June 30).

Submitted our paper Network Reliability Estimation in Theory and Practice to the journal: Reliability Engineering & System Safety

2 Papers accepted at CP-2018. The first paper is on FPRAS for DNF-Counting while the second paper is on interpretable rule learning using MaxSAT

Thrilled and honored to receive Ralph Budd Award for research in Engineering. This award, established in 1935, is given annually to the graduate student judged to have the best doctoral thesis in the School of Engineering.

Prof. Vijay Ganesh is visiting our group from April 18– April 21. Welcome to Singapore, Vijay!

Prof. Sourav Chakraborty is visiting our group for the next two weeks. Welcome Prof. Chakraborty!

Dr. Mate Soos has joined as Research Fellow. Welcome Mate.

Tutorial (to be co-presented with Supratik Charabkroty) accepted at IJCAI-18

I am teaching CS4244: Knowledge-Based Systems with a major revision to the existing syllabus.

I will be teaching a day long tutorial at NUS today on Sampling and Integration.

Our paper on measurement of Quantified Information Flow will be presented today at VMCAI18.

Moved to Singapore yesterday. Officially joined School of Computing at NUS.

Co-organized workshop on Probabilistic Reasonining and Formal Methods with over 40 registrants at FSTTCS.

Attending SAT+SMT Winter School at Mysore Park.

Submitted my PhD Thesis. So long and thanks for all the fish!

S. Akshay and I are organizing workshop on probabilistic reasoning and formal methods at FSTTCS 2017 on Dec 11.

Our Paper on DNF counting is accepted at FSTTCS 2017. Congratulations Aditya for his first paper.

Submitted paper on DNF counting to FSTTCS 2017

Successfully defended PhD thesis!

Submitted paper on DNF counting to CP 2017

I will be joining National University of Singapore as Assistant Professor in Jan 2018.

Our paper on runtime behavior of CNF-XOR formulas is accepted for publication at IJCAI-17

Submitted paper on QIF using ApproxMC to [ESORICS-17][esorics] [esorics]:https://www.ntnu.edu/esorics2017

Supratik Chakraborty, Moshe Vardi and I will be presenting tutorial tomorrow at [AAAI 2017][aaai] on Discrete Sampling and Integration. [aaai]:http://www.aaai.org/Conferences/AAAI/2017/aaai17call.php

I am serving on Program Committee of CP 2017. Please consider submitting your work by April 30.

Our paper on reliability estimation for using ApproxMC is accepted to AAAI 2017.

Submitted paper on behavior of CNF and XOR formulas to AISTATS 2017.

Tutorial on Sampling and Discrete Integration accepted to AAAI 2017

Submitted 2 papers to AAAI 2017.

Back to Toronto for [Fields Institute Workshop on SAT Solving 2016][fields]. My Invited Talk on Approximate Counting is scheduled on Thursday, Aug 18.
[fields]:http://www.fields.utoronto.ca/activities/16-17/SAT-solving

Will be in Toronto for [CAV 2016][cav]. Looking forward to talk by Prof. Moshe Vardi on our progress on Constrained Sampling and Counting. [cav]:http://i-cav.org/2016/

Will be at [IJCAI-16][ijcai] for our two papers on phase transition and approximate counting respectively. I will be presenting our recent result on reduction of SAT calls from linear to logarithmic for hashing-based approximate counting/inference techniques. [ijcai]:http://ijcai-16.org/

Prof. Supratik Chakraborty and I will be presenting tutorial at [UAI 2016][uai] on Discrete Sampling and Integration. [uai]:http://auai.org/uai2016/program.php

Thrilled and honored to receive [Lodieska Stockbridge Vaughn Fellowship][vaughn] (2016-17). [vaughn]:http://www.cs.rice.edu/news/2016/kuldeep-meel-wins-vaughn-fellowship/

Paper on Design and Verification of Distributed Phasers is accepted to [Euro-Par’16][europar] [europar]:https://europar2016.inria.fr/

Two papers accepted to IJCAI 2016. Paper 1: “Combining the k-CNF and XOR Phase-Transitions” with Jeffrey Dudek and Moshe Vardi

Paper 2: “Improving Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Solver Calls” with Supratik Chakraborty and Moshe Vardi.

Thrilled and honored to receive [IBM PhD fellowship][ibm] (2016-17). [ibm]:http://www.research.ibm.com/university/awards/phdfellowship.shtml

Submitted our paper on game theory to EC’16.

I will be visting [UCB][ucb] from Feb 22-25. My talk on SMT counter is scheduled on Feb 24. [ucb]:http://www.eecs.berkeley.edu/

Submitted our paper on distributed phasers to [Euro-Par’16][euro]. [euro]:https://europar2016.inria.fr/

Reached Phoenix. My talks are scheduled on 11th ([BNP][bnp] workshop) and 14th ( [AAAI][aaai] conference) [aaai]:http://www.aaai.org/Conferences/AAAI/2016/aaai16call.php [bnp]:http://beyondnp.org/workshop16/

Submitted 3 papers to IJCAI 2016. Wake me up when rebuttal starts :)

Our paper on automatic generation of data layout has been accepted for publication at CC 2016

Reached CMI [Chennai Mathematical Institute][cmi] for two day visit (Jan 19-20). Talk on Jan 19. Title: “Constrained Sampling and Counting: When Practice Drives Theory” [cmi]:http://www.cmi.ac.in/

Visited [IBM Haifa][ibm-haifa] today. Presented our work on sampling and counting. Talk title: “Scalable Techniques for Constrained Sampling and Counting”. [ibm-haifa]: https://www.research.ibm.com/haifa/

Seminar talk at CS Theory Group of [Hebrew University of Jerusalem][huji]. Talk Title: “Constrained Sampling and Counting: When Practice Drives Theory” [huji]: http://www.cs.huji.ac.il/site/index.php

Submitted paper on data layout generation to CC 2016

Our paper on overview of hashing-based sampling and counting is accepted for publication at BNP 2016

Attending HVC 2015 for the next 3 days. Excited to meet my collaborator Alexander Ivrii in person for the first time.

Our paper on approximate probabilistic inference via word-level counting is accepted for publication at AAAI 2016

Submitted overview paper on hashing-based sampling and counting to Beyond NP Workshop 2016.

Reached Jerusalem. Visiting Israel Institute for Advanced Studies(IIAS) for two months.

I will be visiting MSR India for two weeks and CMI for two days in January

Submitted two papers to AAAI 2016.

Our poster paper on “Distributed Phasers” is accepted to PACT 2015.

Reached Houston. Roadtrip to Ireland’s west coast with Rufus Holmes and Patrick Beuchert was certainly the highlight of my summer. Could not have imagined a better way to end 4 month long trip. Feels nice to be back home.

Had a great time at HLF. Reached Cork, Ireland for CP 2015. The talk is scheduled on 09/01. Our paper on “On Computing Minimal Independent Support and Its applications to Sampling and Counting” won the “Best Student Paper Award” as well :)

Reached Heidelberg, Germany for Heidelberg Laureate Forum (HLF). Excited to interact with some of my heroes. Poster session is scheduled on 08/27.

In Sikar for two weeks. Looking forward to gaining few pounds with all the delicious food cooked by my mom.

End of summer internship at MSR, India. Had a great time working with Aditya Nori and Sriram Rajamani[sriram]. My project was related to probabilistic programming. Looking forward to submitting the paper.

Visiting IBM Research, Bangalore. My talk “Designing Scalable Techniques for Dynamic Verification and Probabilistic Inference” is scheduled from 2-3 PM.

Reached Buenos Aires for IJCAI. My talk is scheduled on 30th July for our paper “From Weighted to Unweighted model counting”

Notification of Best Student Paper Award for CP paper on computing minimal independent support.

Our paper on computing minimal independent support is accepted for publication at CP 2015

And the summer internship at Microsoft Research India, Bangalore begins.

Talk on “Sampling from combinatorial spaces: Achieving the fine balancing act between independence and scalability.” in CSE Dept at IIT Bombay.

Will be in Vienna from May 12-16 for VCLA Award Ceremony. My talk is on on May 15. See schedule of [PhDs In Logic][phd] for more details. [phd]:http://phdsinlogic.logic-cs.at/

Submitted paper to CP 2015

Selected to participate in 3rd Heidelberg Forum

Our paper on counting is accepted for IJCAI 2015

Flying to London to attend [ETAPS][etaps] 2015. Talk on 04/15 in TACAS and do check out demo of our tool on 04/14. [etaps]:www.etaps.org/index.php/2015/tacas

Submitted a paper on distributed phasers to PACT

Submitted a paper on weighted model counting to IJCAI

I will be receiving 2014 Oustanding Master’s Thesis Award from [Vienna Center for Logic and Algorithms][vcla] [vcla]:http://www.vcla.at/

Will be attending [AAAI 2015][aaai15]. Invited to participate in workshop on “Future of AAAI”. [aaai15]: http://www.aaai.org/Conferences/AAAI/aaai15.php

Our paper on sampling is accepted for TACAS 2015

Honored to be chosen among “AI’s 10 to Watch” by IEEE Intelligent Systems. I owe it to my amazing mentors and colleagues (particularly, my students) for the exciting collaborations all these years.

Our work on scalable quantitative verification for deep neural networks has been accepted to ICSE 2021.