DeepAI AI Chat
Log In Sign Up

Probabilistic Theorem Proving

by   Vibhav Gogate, et al.

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable elimination and belief propagation, neither of which take logical structure into account. We propose the first method that has the full power of both graphical model inference and first-order theorem proving (in finite domains with Herbrand interpretations). We first define probabilistic theorem proving, their generalization, as the problem of computing the probability of a logical formula given the probabilities or weights of a set of formulas. We then show how this can be reduced to the problem of lifted weighted model counting, and develop an efficient algorithm for the latter. We prove the correctness of this algorithm, investigate its properties, and show how it generalizes previous approaches. Experiments show that it greatly outperforms lifted variable elimination when logical structure is present. Finally, we propose an algorithm for approximate probabilistic theorem proving, and show that it can greatly outperform lifted belief propagation.


Formula-Based Probabilistic Inference

Computing the probability of a formula given the probabilities or weight...

Lifted Variable Elimination for Probabilistic Logic Programming

Lifted inference has been proposed for various probabilistic logical fra...

A Study of Continuous Vector Representationsfor Theorem Proving

Applying machine learning to mathematical terms and formulas requires a ...

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference

Probabilistic inference algorithms for finding the most probable explana...

An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models

Probabilistic inference in graphical models is the task of computing mar...

Asymptotic elimination of partially continuous aggregation functions in directed graphical models

In Statistical Relational Artificial Intelligence, a branch of AI and ma...

Splitting Proofs for Interpolation

We study interpolant extraction from local first-order refutations. We p...