activity
20152026
most citedEfficient Learning of Interpretable Classification Rules

12 citations · 34 across the 22 of their papers we have counts for

collaborators
Showing 2025Show all

7 papers · 1 filter

cs.FL2025★ 1 cited

Counting and Sampling Traces in Regular Languages

Alexis de Colnet, Kuldeep S. Meel, Umang Mathur

In this work, we study the problems of counting and sampling Mazurkiewicz traces that a regular language touches. Fix an alphabet and an independence relation $\mathbb{I} \subs…

cs.LO2025

Efficient Volume Computation for SMT Formulas

Arijit Shaw, Uddalok Sarkar, Kuldeep S. Meel

Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiabilit…

cs.AI2025

Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification

Yuke Liao, Blaise Genest, Kuldeep Meel +1

To handle complex instances, we revisit a divide-and-conquer approach to break down the complexity: instead of few complex BaB calls, we rely on many small {\em partial} MILP calls…

cs.LO2025

Approximate SMT Counting Beyond Discrete Domains

Arijit Shaw, Kuldeep S. Meel

Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional mode…

cs.DS2025

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence

Kuldeep S. Meel, Alexis de Colnet

#NFA refers to the problem of counting the words of length accepted by a non-deterministic finite automaton. #NFA is #P-hard, and although fully-polynomial-time randomized appr…

stat.CO2025

Assessing the Quality of Binomial Samplers: A Statistical Distance Framework

Uddalok Sarkar, Sourav Chakraborty, Kuldeep S. Meel

Randomized algorithms depend on accurate sampling from probability distributions, as their correctness and performance hinge on the quality of the generated samples. However, even…

cs.DS2025

Algorithms and Hardness for Estimating Statistical Similarity

Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel +3

We introduce and study the computational problem of determining statistical similarity between probability distributions. For distributions and over a finite sample space,…