82 citations · 369 across the 63 of their papers we have counts for
11 papers · 1 filter
On Testing of Samplers
Kuldeep S. Meel, Yash Pote, Sourav Chakraborty
Given a set of items and a weight function , the problem of sampling seeks to sample an item proportional to its weight. Sampl…
Taming Discrete Integration via the Boon of Dimensionality
Jeffrey M. Dudek, Dror Fried, Kuldeep S. Meel
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from resear…
Justicia: A Stochastic SAT Approach to Formally Verify Fairness
Bishwamittra Ghosh, Debabrota Basu, Kuldeep S. Meel
As a technology ML is oblivious to societal good or bad, and thus, the field of fair machine learning has stepped up to propose multiple mathematical definitions, algorithms, and s…
Induction Models on \mathbb{N}
A. Dileep, Kuldeep S. Meel, Ammar F. Sabili
Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting wh…
Phase Transition Behavior in Knowledge Compilation
Rahul Gupta, Subhajit Roy, Kuldeep S. Meel
The study of phase transition behaviour in SAT has led to deeper understanding and algorithmic improvements of modern SAT solvers. Motivated by these prior studies of phase transit…
Manthan: A Data Driven Approach for Boolean Function Synthesis
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Boolean functional synthesis is a fundamental problem in computer science with wide-ranging applications and has witnessed a surge of interest resulting in progressively improved t…
Designing New Phase Selection Heuristics
Arijit Shaw, Kuldeep S. Meel
CDCL-based SAT solvers have transformed the field of automated reasoning owing to their demonstrated efficiency at handling problems arising from diverse domains. The success of CD…
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice
Kuldeep S. Meel, S. Akshay
Given a CNF formula F on n variables, the problem of model counting or #SAT is to compute the number of satisfying assignments of F . Model counting is a fundamental but hard probl…
Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel +1
We design efficient distance approximation algorithms for several classes of structured high-dimensional distributions. Specifically, we show algorithms for the following problems:…
Scalable Quantitative Verification For Deep Neural Networks
Teodora Baluta, Zheng Leong Chua, Kuldeep S. Meel +1
Despite the functional success of deep neural networks (DNNs), their trustworthiness remains a crucial open challenge. To address this challenge, both testing and verification tech…
IMLI: An Incremental Framework for MaxSAT-Based Learning of Interpretable Classification Rules
Bishwamittra Ghosh, Kuldeep S. Meel
The wide adoption of machine learning in the critical domains such as medical diagnosis, law, education had propelled the need for interpretable techniques due to the need for end…