A recursive algorithm for projected model counting

Abstract

We present a recursive algorithm for projected model counting, i.e., the problem consisting in determining the number of models k?X.Sk of a propositional formula S after eliminating from it a given set X of variables. Based on a”standard” model counter, our algorithm projMC takes advantage of a disjunctive decomposition scheme of ?X.S for computing k?X.Sk. It also looks for disjoint components in its input for improving the computation. Our experiments show that in many cases projMC is significantly more efficient than the previous algorithms for projected model counting from the literature.