82 citations · 369 across the 63 of their papers we have counts for
23 papers · 1 filter
The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques
Brendan Juba, Kuldeep S. Meel
Given a Boolean relational specification between inputs and outputs, the problem of functional synthesis is to construct a function that maps each assignment of the input to an ass…
Counting Answer Sets of Disjunctive Answer Set Programs
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel
Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computa…
A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
Mohimenul Kabir, Kuldeep S Meel
The hitting set problem is a fundamental problem in computer science and mathematics. Given a family of sets over a universe of elements, a minimal hitting set is a subset-minimal…
Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva +1
Boolean Networks (BNs) serve as a fundamental modeling framework for capturing complex dynamical systems across various domains, including systems biology, computational logic, and…
On Top-Down Pseudo-Boolean Model Counting
Suwei Yang, Yong Lai, Kuldeep S. Meel
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…
Towards Practical First-Order Model Counting
Ananth K. Kidambi, Guramrit Singh, Paulius Dilkas +1
First-order model counting (FOMC) is the problem of counting the number of models of a sentence in first-order logic. Since lifted inference techniques rely on reductions to varian…
On Lower Bounding Minimal Model Count
Mohimenul Kabir, Kuldeep S Meel
Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our s…
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…
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…
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…
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…
Induction Models on \mathbb{N}
A. Dileep, Kuldeep S. Meel, Ammar F. Sabili
Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting wh…
Designing New Phase Selection Heuristics
Arijit Shaw, Kuldeep S. Meel
CDCL-based SAT solvers have transformed the field of automated reasoning owing to their demonstrated efficiency at handling problems arising from diverse domains. The success of CD…
BOSPHORUS: Bridging ANF and CNF Solvers
Davin Choo, Mate Soos, Kian Ming A. Chai +1
Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, ofte…
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
Kuldeep S. Meel
Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and…
On Hashing-Based Approaches to Approximate DNF-Counting
Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi
Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncerta…
Sampling Techniques for Boolean Satisfiability
Kuldeep S. Meel
Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the class…
Balancing Scalability and Uniformity in SAT Witness Generator
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Constrained-random simulation is the predominant approach used in the industry for functional verification of complex digital designs. The effectiveness of this approach depends on…
A Scalable Approximate Model Counter
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Propositional model counting} (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest…
A Scalable and Nearly Uniform Generator of SAT Witnesses
Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi
Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the funct…