Approximate Model Counting by Partial Knowledge Compilation

by   Yong Lai, et al.

Model counting is the problem of computing the number of satisfying assignments of a given propositional formula. Although exact model counters can be naturally furnished by most of the knowledge compilation (KC) methods, in practice, they fail to generate the compiled results for the exact counting of models for certain formulas due to the explosion in sizes. Decision-DNNF is an important KC language that captures most of the practical compilers. We propose a generalized Decision-DNNF (referred to as partial Decision-DNNF) via introducing a class of new leaf vertices (called unknown vertices), and then propose an algorithm called PartialKC to generate randomly partial Decision-DNNF formulas from the given formulas. An unbiased estimate of the model number can be computed via a randomly partial Decision-DNNF formula. Each calling of PartialKC consists of multiple callings of MicroKC, while each of the latter callings is a process of importance sampling equipped with KC technologies. The experimental results show that PartialKC is more accurate than both SampleSearch and SearchTreeSampler, PartialKC scales better than SearchTreeSampler, and the KC technologies can obviously accelerate sampling.


page 1

page 2

page 3

page 4


The Good Old Davis-Putnam Procedure Helps Counting Models

As was shown recently, many important AI problems require counting the n...

Lifted Algorithms for Symmetric Weighted First-Order Model Sampling

Weighted model counting (WMC) is the task of computing the weighted sum ...

Formula-Based Probabilistic Inference

Computing the probability of a formula given the probabilities or weight...

Algorithmically Efficient Syntactic Characterization of Possibility Domains

We call domain any arbitrary subset of a Cartesian power of the set {0,1...

Counting solutions to random CNF formulas

We give the first efficient algorithm to approximately count the number ...

ADDMC: Exact Weighted Model Counting with Algebraic Decision Diagrams

We compute exact literal-weighted model counts of CNF formulas. Our algo...

The Model Counting Competition 2020

Many computational problems in modern society account to probabilistic r...

Please sign up or login with your details

Forgot password? Click here to reset