Search Results for author:
Found 4 papers, 1 papers with code
Auditable Algorithms for Approximate Model Counting
Since $n$ is often large, we ask if the count of variables in the certificate can be reduced -- a crucial question for potential implementation.
Synthesizing Pareto-Optimal Interpretations for Black-Box Models
For a given black-box, our approach yields a set of Pareto-optimal interpretations with respect to the correctness and explainability measures.
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Additionally, a specification admits a polynomial-sized functional solution iff there exists a semantically equivalent polynomial-sized SAUNF representation.
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice
In this paper, we address this challenge from theoretical and practical perspectives.
