On the Approximability of Weighted Model Integration on DNF Structures

by   Ralph Abboud, et al.

Weighted model counting admits an FPRAS on DNF structures. We study weighted model integration, which is a generalization of weighted model counting, and pose the following question: Does weighted model integration on DNF structures admit an FPRAS? Building on classical results, we show that this problem can indeed be approximated for a class of weight functions. Our approximation algorithm is based on three subroutines, each of which can be a weak (i.e., approximate), or a strong (i.e., exact) oracle, and in all cases, comes along with accuracy guarantees. We experimentally verify our approach, and show that our algorithm scales to large problem instances, which are currently out of reach for existing, general-purpose weighted model integration solvers.


page 1

page 2

page 3

page 4


Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting

Weighted model counting has emerged as a prevalent approach for probabil...

Measure Theoretic Weighted Model Integration

Weighted model counting (WMC) is a popular framework to perform probabil...

Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry

We study the symmetric weighted first-order model counting task and pres...

Tractability of L_2-approximation and integration in weighted Hermite spaces of finite smoothness

In this paper we consider integration and L_2-approximation for function...

The Metric Space of Networks

We study the question of reconstructing a weighted, directed network up ...

High Dimensional Discrete Integration by Hashing and Optimization

Recently Ermon et al. (2013) pioneered an ingenuous way to practically c...

Efficient Search-Based Weighted Model Integration

Weighted model integration (WMI) extends Weighted model counting (WMC) t...

Please sign up or login with your details

Forgot password? Click here to reset