Extended Lifted Inference with Joint Formulas

02/14/2012
by   Udi Apsel, et al.
0

The First-Order Variable Elimination (FOVE) algorithm allows exact inference to be applied directly to probabilistic relational models, and has proven to be vastly superior to the application of standard inference methods on a grounded propositional model. Still, FOVE operators can be applied under restricted conditions, often forcing one to resort to propositional inference. This paper aims to extend the applicability of FOVE by providing two new model conversion operators: the first and the primary is joint formula conversion and the second is just-different counting conversion. These new operations allow efficient inference methods to be applied directly on relational models, where no existing efficient method could be applied hitherto. In addition, aided by these capabilities, we show how to adapt FOVE to provide exact solutions to Maximum Expected Utility (MEU) queries over relational models for decision under uncertainty. Experimental evaluations show our algorithms to provide significant speedup over the alternatives.

READ FULL TEXT
research
03/15/2012

Lifted Inference for Relational Continuous Models

Relational Continuous Models (RCMs) represent joint probability densitie...
research
07/11/2012

Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assesments

This paper investigates a representation language with flexibility inspi...
research
05/13/2014

Lifted Variable Elimination for Probabilistic Logic Programming

Lifted inference has been proposed for various probabilistic logical fra...
research
08/19/2012

Lifted Variable Elimination: A Novel Operator and Completeness Results

Various methods for lifted probabilistic inference have been proposed, b...
research
02/04/2014

Lifted Variable Elimination: Decoupling the Operators from the Constraint Language

Lifted probabilistic inference algorithms exploit regularities in the st...
research
07/02/2018

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

Standard approaches for inference in probabilistic formalisms with first...
research
04/15/2012

Lower Complexity Bounds for Lifted Inference

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

Please sign up or login with your details

Forgot password? Click here to reset