Approximate weighted model integration on DNF structures
Weighted model counting consists of computing the weighted sum of all satisfying assignments of a propositional formula. Weighted model counting is well-known to be #P-hard for exact solving, but admits a fully polynomial randomized approximation scheme when restricted to DNF structures. In this wor...
Main Authors: | , , |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
Elsevier
2022
|