Kuldeep S. Meel

Counting Minimal Unsatisfiable Subsets

2021 · Lecture notes in computer science

Abstract Given an unsatisfiable Boolean formula F in CNF, an unsatisfiable subset of clauses U of F is called Minimal Unsatisfiable Subset (MUS) if every proper subset of U is satisfiable. Since MUSes serve as …

Total Variation Distance for Product Distributions is $\#\mathsf{P}$-Complete

2024 · arXiv (Cornell University)

We show that computing the total variation distance between two product distributions is $\#\mathsf{P}$-complete. This is in stark contrast with other distance measures such as Kullback-Leibler, Chi-square, and Hellinger, which tensorize over the marginals leading …

On Top-Down Pseudo-Boolean Model Counting

2025 · arXiv (Cornell University)

Pseudo-Boolean model counting involves computing the number of satisfying assignments of a given pseudo-Boolean (PB) formula. In recent years, PB model counting has seen increased interest partly owing to the succinctness of PB formulas over …