DeepAI AI Chat
Log In Sign Up

Formula-Based Probabilistic Inference

03/15/2012
by   Vibhav Gogate, et al.
0

Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in the literature to date, particularly considering that it includes many standard inference problems as special cases. In this paper, we propose two algorithms for this problem: formula decomposition and conditioning, which is an exact method, and formula importance sampling, which is an approximate method. The latter is, to our knowledge, the first application of model counting to approximate probabilistic inference. Unlike conventional variable-based algorithms, our algorithms work in the dual realm of logical formulas. Theoretically, we show that our algorithms can greatly improve efficiency by exploiting the structural information in the formulas. Empirically, we show that they are indeed quite powerful, often achieving substantial performance gains over state-of-the-art schemes.

READ FULL TEXT
02/14/2012

Probabilistic Theorem Proving

Many representation schemes combining first-order logic and probability ...
05/18/2018

Approximate Model Counting by Partial Knowledge Compilation

Model counting is the problem of computing the number of satisfying assi...
04/22/2021

A New Approach to CNF-SAT From a Probabilistic Point of View

The following paper proposes a new approach to determine whether a logic...
02/14/2012

Inference in Probabilistic Logic Programs using Weighted CNF's

Probabilistic logic programs are logic programs in which some of the fac...
01/01/1998

Incremental Recompilation of Knowledge

Approximating a general formula from above and below by Horn formulas (i...
07/25/2019

Probabilistic Approximate Logic and its Implementation in the Logical Imagination Engine

In spite of the rapidly increasing number of applications of machine lea...
04/15/2012

Lower Complexity Bounds for Lifted Inference

One of the big challenges in the development of probabilistic relational...