A Relaxed Tseitin Transformation for Weighted Model Counting
نویسندگان
چکیده
The task of Weighted Model Counting is to compute the sum of the weights of all satisfying assignments of a propositional sentence. One recent key insight is that, by allowing negative weights, one can restructure the sentence to obtain a representation that allows for more efficient counting. This has been shown for formulas representing Bayesian networks with noisy-OR structures (Vomlel and Savicky 2008; Li, Poupart, and van Beek 2011) and for first-order model counting (Van den Broeck, Meert, and Darwiche 2014). In this work, we introduce the relaxed Tseitin transformation and show that the aforementioned techniques are special cases of this relaxation.
منابع مشابه
Three New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملDistribution-Aware Sampling and Weighted Model Counting for SAT
Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distribution-aware sampling of satisfying assignments. Both problems have a wide variety of important applications. Due to the inherent complexity of the exact versions of the problems, interest has focused on solving them approximately. Prior work in this area scale...
متن کاملFrom Weighted to Unweighted Model Counting
The recent surge of interest in reasoning about probabilistic graphical models has led to the development of various techniques for probabilistic reasoning. Of these, techniques based on weighted model counting are particularly interesting since they can potentially leverage recent advances in unweighted model counting and in propositional satisfiability solving. In this paper, we present a new...
متن کاملLinear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract)
Two important algebraic proof systems are the Nullstellensatz system [1] and the polynomial calculus [2] (also called the Gröbner system). The Nullstellensatz system is a propositional proof system based on Hilbert’s Nullstellensatz, and the polynomial calculus (PC) is a proof system which allows derivations of polynomials, over some £eld. The complexity of a proof in these systems is measured ...
متن کاملExplanation-Based Approximate Weighted Model Counting for Probabilistic Logics
Probabilistic inference can be realized using weighted model counting. Despite a lot of progress, computing weighted model counts exactly is still infeasible for many problems of interest, and one typically has to resort to approximation methods. We contribute a new bounded approximation method for weighted model counting based on probabilistic logic programming principles. Our bounded approxim...
متن کامل