Belle, Vaishak

Dilkas, Paulius

English

Weighted model counting (WMC) is a powerful computational technique for a variety of problems, especially commonly used for probabilistic inference. However, the standard definition of WMC that puts weights on literals often necessitates WMC encodings to include additional variables and clauses just so each weight can be attached to a literal. This paper complements previous work by considering WMC instances in their full generality and using recent state-of-the-art WMC techniques based on pseudo-Boolean function manipulation, competitive with the more traditional WMC algorithms based on knowledge compilation and backtracking search. We present an algorithm that transforms WMC instances into a format based on pseudo-Boolean functions while eliminating around 43% of variables on average across various Bayesian network encodings. Moreover, we identify sucient conditions for such a variable removal to be possible. Our experiments show signicant improvement in WMC-based Bayesian network inference, outperforming the current state of the art

Edinburgh Research Explorer

Weighted Model Counting Without Parameter Variables

https://www.research.ed.ac.uk/files/213422322/Weighted_Model_Counting_DILKAS_DOA05052021_AFV.pdf

Weighted Model Counting Without Parameter Variables

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer