Approximate Model Counting, Sparse XOR Constraints and Minimum Distance

07/11/2019
by   Michele Boreale, et al.
0

The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem. For this reason, many approximate counters have been developed in the last decade, offering formal guarantees of confidence and accuracy. A popular approach is based on the idea of using random XOR constraints to, roughly, successively halving the solution set until no model is left: this is checked by invocations to a SAT solver. The effectiveness of this procedure hinges on the ability of the SAT solver to deal with XOR constraints, which in turn crucially depends on the length of such constraints. We study to what extent one can employ sparse, hence short, constraints, keeping guarantees of correctness. We show that the resulting bounds are closely related to the geometry of the set of models, in particular to the minimum Hamming distance between models. We evaluate our theoretical results on a few concrete formulae. Based on our findings, we finally discuss possible directions for improvements of the current state of the art in approximate model counting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2023

Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?

Given a Boolean formula ϕ over n variables, the problem of model countin...
research
11/02/2022

BAXMC: a CEGAR approach to Max#SAT

Max#SAT is an important problem with multiple applications in security a...
research
05/17/2023

Function synthesis for maximizing model counting

Given a boolean formula Φ(X, Y, Z), the Max#SAT problem asks for finding...
research
05/16/2023

Rounding Meets Approximate Model Counting

The problem of model counting, also known as #SAT, is to compute the num...
research
12/21/2017

Bit-Vector Model Counting using Statistical Estimation

Approximate model counting for bit-vector SMT formulas (generalizing #SA...
research
05/16/2022

Efficient Knowledge Compilation Beyond Weighted Model Counting

Quantitative extensions of logic programming often require the solution ...
research
09/14/2023

International Competition on Graph Counting Algorithms 2023

This paper reports on the details of the International Competition on Gr...

Please sign up or login with your details

Forgot password? Click here to reset