Search Results for author:
Found 3 papers, 1 papers with code
Exact ASP Counting with Compact Encodings
In recent years, there has been growing interest in problems beyond satisfiability, such as model counting, in the context of ASP.
Testing Probabilistic Circuits
Thus, given two probabilistic circuits, a fundamental problem of interest is to determine whether their distributions are close to each other. The primary contribution of this paper is a closeness test for PCs with respect to the total variation distance metric.
Partition Function Estimation: A Quantitative Study
Given the #P-hardness of computing the partition function, several techniques have been proposed over the years with varying guarantees on the quality of estimates and their runtime behavior.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
