82 citations · 369 across the 63 of their papers we have counts for
7 papers · 1 filter
Probabilistic Explanations for Linear Models
Bernardo Subercaseaux, Marcelo Arenas, Kuldeep S Meel
Formal XAI is an emerging field that focuses on providing explanations with mathematical guarantees for the decisions made by machine learning models. A significant amount of work…
Towards Projected and Incremental Pseudo-Boolean Model Counting
Suwei Yang, Kuldeep S. Meel
Model counting is a fundamental task that involves determining the number of satisfying assignments to a logical formula, typically in conjunctive normal form (CNF). While CNF mode…
Engineering an Efficient Approximate DNF-Counter
Mate Soos, Uddalok Sarkar, Divesh Aggarwal +3
Model counting is a fundamental problem in many practical applications, including query evaluation in probabilistic databases and failure-probability estimation of networks. In thi…
The Cardinality of Identifying Code Sets for Soccer Ball Graph with Application to Remote Sensing
Anna L. D. Latour, Arunabha Sen, Kaustav Basu +2
In the context of satellite monitoring of the earth, we can assume that the surface of the earth is divided into a set of regions. We assume that the impact of a big social/environ…
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…
#CFG and #DNNF admit FPRAS
Kuldeep S. Meel, Alexis de Colnet
We provide the first fully polynomial-time randomized approximation scheme for the following two counting problems: 1. Given a Context Free Grammar over alphabet , count the…
An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
Kuldeep S. Meel, Alexis de Colnet
Non-deterministic read-once branching programs, also known as non-deterministic free binary decision diagrams (nFBDD), are a fundamental data structure in computer science for repr…