82 citations · 214 across the 25 of their papers we have counts for
4 papers · 1 filter
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…
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-…
Skolem Functions for Factored Formulas
Ajith K. John, Shetal Shah, Supratik Chakraborty +2
Given a propositional formula F(x,y), a Skolem function for x is a function Ψ(y), such that substituting Ψ(y) for x in F gives a formula semantically equivalent to \exists F. Autom…
Word-level Symbolic Trajectory Evaluation
Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger +4
Symbolic trajectory evaluation (STE) is a model checking technique that has been successfully used to verify industrial designs. Existing implementations of STE, however, reason at…