Counting and Conjunctive Queries in the Lifted Junction Tree Algorithm

Abstract

Standard approaches for inference in probabilistic formalisms with first-order constructs include lifted variable elimination (LVE) for single queries. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) uses a first-order cluster representation of a knowledge base and LVE in its computations. We extend LJT with a full formal… (More)
DOI: 10.1007/978-3-319-78102-0_3

5 Figures and Tables

Topics

  • Presentations referencing similar topics