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

01/15/2020
by   Timothy van Bremen, et al.
0

We study the symmetric weighted first-order model counting task and present ApproxWFOMC, a novel anytime method for efficiently bounding the weighted first-order model count in the presence of an unweighted first-order model counting oracle. The algorithm has applications to inference in a variety of first-order probabilistic representations, such as Markov logic networks and probabilistic logic programs. Crucially for many applications, we make no assumptions on the form of the input sentence. Instead, our algorithm makes use of the symmetry inherent in the problem by imposing cardinality constraints on the number of possible true groundings of a sentence's literals. Realising the first-order model counting oracle in practice using the approximate hashing-based model counter ApproxMC3, we show how our algorithm outperforms existing approximate and exact techniques for inference in first-order probabilistic models. We additionally provide PAC guarantees on the generated bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2013

Skolemization for Weighted First-Order Model Counting

First-order model counting emerged recently as a novel reasoning task, a...
research
03/22/2019

A Model Counter's Guide to Probabilistic Systems

In this paper, we systematize the modeling of probabilistic systems for ...
research
05/13/2014

Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting

In this paper we study lifted inference for the Weighted First-Order Mod...
research
04/04/2019

Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting

Weighted model counting has emerged as a prevalent approach for probabil...
research
02/17/2020

On the Approximability of Weighted Model Integration on DNF Structures

Weighted model counting admits an FPRAS on DNF structures. We study weig...
research
09/25/2020

Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula

Weighted First Order Model Counting (WFOMC) computes the weighted sum of...
research
07/02/2018

Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm

Standard approaches for inference in probabilistic formalisms with first...

Please sign up or login with your details

Forgot password? Click here to reset