82 citations · 369 across the 63 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.AI2015★ 55 cited
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty +5
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to con…
cs.AI2015★ 31 cited
Approximate Probabilistic Inference via Word-Level Counting
Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry +1
Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-…