82 citations · 369 across the 63 of their papers we have counts for
16 papers · 1 filter
Auditable Algorithms for Approximate Model Counting
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Model counting, or counting the satisfying assignments of a Boolean formula, is a fundamental problem with diverse applications. Given #P-hardness of the problem, developing algori…
Exact ASP Counting with Compact Encodings
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel
Answer Set Programming (ASP) has emerged as a promising paradigm in knowledge representation and automated reasoning owing to its ability to model hard combinatorial problems from…
Engineering an Exact Pseudo-Boolean Model Counter
Suwei Yang, Kuldeep S. Meel
Model counting, a fundamental task in computer science, involves determining the number of satisfying assignments to a Boolean formula, typically represented in conjunctive normal…
An Approximate Skolem Function Counter
Arijit Shaw, Brendan Juba, Kuldeep S. Meel
One approach to probabilistic inference involves counting the number of models of a given Boolean formula. Here, we are interested in inferences involving higher-order objects, i.e…
Locally-Minimal Probabilistic Explanations
Yacine Izza, Kuldeep S. Meel, Joao Marques-Silva
Explainable Artificial Intelligence (XAI) is widely regarding as a cornerstone of trustworthy AI. Unfortunately, most work on XAI offers no guarantees of rigor. In high-stakes doma…
Approximating Queries on Probabilistic Graphs
Antoine Amarilli, Timothy van Bremen, Octave Gaspard +1
Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of appro…
Distance Estimation for High-Dimensional Discrete Distributions
Gunjan Kumar, Kuldeep S. Meel, Yash Pote
Given two distributions and over a high-dimensional domain , and a parameter , the goal of distance estimation is to determine t…
Solving the Identifying Code Set Problem with Grouped Independent Support
Anna L. D. Latour, Arunabha Sen, Kuldeep S. Meel
An important problem in network science is finding an optimal placement of sensors in nodes in order to uniquely detect failures in the network. This problem can be modelled as an…
On Scalable Testing of Samplers
Yash Pote, Kuldeep S. Meel
In this paper we study the problem of testing of constrained samplers over high-dimensional distributions with guarantees. Samplers are increasingly used in a w…
INC: A Scalable Incremental Weighted Sampler
Suwei Yang, Victor C. Liang, Kuldeep S. Meel
The fundamental problem of weighted sampling involves sampling of satisfying assignments of Boolean formulas, which specify sampling sets, and according to distributions defined by…
Scalable Probabilistic Routes
Suwei Yang, Victor C. Liang, Kuldeep S. Meel
Inference and prediction of routes have become of interest over the past decade owing to a dramatic increase in package delivery and ride-sharing services. Given the underlying com…
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?
Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar +1
Given a Boolean formula over variables, the problem of model counting is to compute the number of solutions of . Model counting is a fundamental problem in computer scie…
Rounding Meets Approximate Model Counting
Jiong Yang, Kuldeep S. Meel
The problem of model counting, also known as #SAT, is to compute the number of models or satisfying assignments of a given Boolean formula . Model counting is a fundamental prob…
Regular Methods for Operator Precedence Languages
Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi +1
The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This inc…
Constraint Optimization over Semirings
A. Pavan, Kuldeep S. Meel, N. V. Vinodchandran +1
Interpretations of logical formulas over semirings have applications in various areas of computer science including logic, AI, databases, and security. Such interpretations provide…
Synthesis with Explicit Dependencies
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Quantified Boolean Formulas (QBF) extend propositional logic with quantification . In QBF, an existentially quantified variable is allowed to depend on all univer…