Picture for Supratik Chakraborty

Supratik Chakraborty

Network Inversion of Binarised Neural Nets

Add code
Feb 19, 2024
Viaarxiv icon

Auditable Algorithms for Approximate Model Counting

Add code
Dec 19, 2023
Viaarxiv icon

Exact ASP Counting with Compact Encodings

Add code
Dec 19, 2023
Viaarxiv icon

Projected Model Counting: Beyond Independent Support

Add code
Oct 18, 2021
Figure 1 for Projected Model Counting: Beyond Independent Support
Figure 2 for Projected Model Counting: Beyond Independent Support
Figure 3 for Projected Model Counting: Beyond Independent Support
Figure 4 for Projected Model Counting: Beyond Independent Support
Viaarxiv icon

Synthesizing Pareto-Optimal Interpretations for Black-Box Models

Add code
Aug 16, 2021
Figure 1 for Synthesizing Pareto-Optimal Interpretations for Black-Box Models
Figure 2 for Synthesizing Pareto-Optimal Interpretations for Black-Box Models
Figure 3 for Synthesizing Pareto-Optimal Interpretations for Black-Box Models
Figure 4 for Synthesizing Pareto-Optimal Interpretations for Black-Box Models
Viaarxiv icon

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis

Add code
Apr 29, 2021
Figure 1 for A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Figure 2 for A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Viaarxiv icon

Approximate Probabilistic Inference via Word-Level Counting

Add code
Feb 09, 2016
Figure 1 for Approximate Probabilistic Inference via Word-Level Counting
Figure 2 for Approximate Probabilistic Inference via Word-Level Counting
Figure 3 for Approximate Probabilistic Inference via Word-Level Counting
Figure 4 for Approximate Probabilistic Inference via Word-Level Counting
Viaarxiv icon

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving

Add code
Dec 21, 2015
Figure 1 for Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Figure 2 for Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Figure 3 for Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Figure 4 for Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Viaarxiv icon

Distribution-Aware Sampling and Weighted Model Counting for SAT

Add code
Apr 11, 2014
Figure 1 for Distribution-Aware Sampling and Weighted Model Counting for SAT
Figure 2 for Distribution-Aware Sampling and Weighted Model Counting for SAT
Figure 3 for Distribution-Aware Sampling and Weighted Model Counting for SAT
Figure 4 for Distribution-Aware Sampling and Weighted Model Counting for SAT
Viaarxiv icon