Abstract Model counting, or counting solutions of a set of constraints, is a fundamental
problem in Computer Science with diverse applications. Since exact counting is …

Probabilistic graphical models have emerged as a powerful modeling tool for several real-
world scenarios where one needs to reason under uncertainty. A graphical model's partition …

5mm Next-Gen Automated Reasoning: ``Beyond SAT'' Revolution Page 1 Counting, Sampling,
and Synthesis: The Quest for Scalability Kuldeep S. Meel School of Computing National …

We present a randomized approximation scheme for the permanent of a matrix with
nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber …

Discrete integration is a fundamental problem in artificial intelligence, with applications in
probabilistic reasoning, planning, inexact computing, engineering reliability, and statistical …

Model counting, or counting the solutions to a set of constraints, is a fundamental
computational problem with applications in diverse areas spanning probabilistic inference …

This research has been in the passive phase of investigations from 2003 to 2015. Despite
the long-time break, the research project has been under some, even if irregular …