Engineering an Efficient Probabilistic Exact Model Counter

Download PDF
Open Webpage

Mate Soos, Kuldeep S. Meel

Published: 2025, Last Modified: 23 Oct 2025CAV (3) 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Given a formula F, the problem of model counting, also known as #SAT, is to compute the number of satisfying assignments of F. While model counting has emerged as a crucial primitive in diverse domains from quantitative information flow analysis to neural network verification, scalability remains a fundamental challenge despite advances in both exact and approximate counting techniques.