Dual Hashing-Based Algorithms for Discrete Integration

Alexis de Colnet, Kuldeep S. Meel

Abstract: Given a boolean formula F and a weight function \(\rho \), the problem of discrete integration seeks to compute the weight of F, defined as the sum of the weights of satisfying assignments. Discrete integration, also known as weighted model counting, is a fundamental problem in computer science with wide variety of applications ranging from machine learning and statistics to physics and infrastructure reliability. Given the intractability of the exact variant, the problem of approximate weighted model counting has been subject to intense theoretical and practical investigations over the years.