Ansuman Banerjee — accepted AI-conference papers

2026

Mining Statistically Likely k-Reachable States in Probabilistic Programs

Arnab Ray, Nitesh Trivedi, Ansuman Banerjee, Sourav Chakraborty, Arijit Ghosh, Subhajit Roy

IJCAI 2026

We propose the notion of statistically likely k-step reachable set in probabilistic programs, a statistically robust notion for high-probability k-step reachable program states. We design an inductive algorithm to capture this set as a symbolic representation in propositional logic for Boolean proba

Cited by 0 Scholar ↗

2023

Testing of Horn Samplers

Ansuman Banerjee, Shayak Chakraborty, Sourav Chakraborty, Kuldeep S. Meel, Uddalok Sarkar, Sayantan Sen

AISTATS 2023poster

Sampling over combinatorial spaces is a fundamental problem in artificial intelligence with a wide variety of applications. Since state-of-the-art techniques heavily rely on heuristics whose rigorous analysis remains beyond the reach of current theoretical tools, the past few years have witnessed in…

Cited by 2 Source ↗PDF ↗code ↗Scholar ↗