DeepAI AI Chat
Log In Sign Up

Lifted Variable Elimination: A Novel Operator and Completeness Results

by   Nima Taghipour, et al.

Various methods for lifted probabilistic inference have been proposed, but our understanding of these methods and the relationships between them is still limited, compared to their propositional counterparts. The only existing theoretical characterization of lifting is for weighted first-order model counting (WFOMC), which was shown to be complete domain-lifted for the class of 2-logvar models. This paper makes two contributions to lifted variable elimination (LVE). First, we introduce a novel inference operator called group inversion. Second, we prove that LVE augmented with this operator is complete in the same sense as WFOMC.


page 1

page 2

page 3

page 4


Variable elimination in binary CSPs

We investigate rules which allow variable elimination in binary CSP (con...

Lifted Variable Elimination for Probabilistic Logic Programming

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

Lifted Inference with Linear Order Axiom

We consider the task of weighted first-order model counting (WFOMC) used...

Extended Lifted Inference with Joint Formulas

The First-Order Variable Elimination (FOVE) algorithm allows exact infer...

First-Order Decomposition Trees

Lifting attempts to speed up probabilistic inference by exploiting symme...

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

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

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...