Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fusing First-order Knowledge Compilation and the Lifted Junction Tree
  Algorithm   Standard approaches for inference in probabilistic formalisms with
first-order constructs include lifted variable elimination (LVE) for single
queries as well as first-order knowledge compilation (FOKC) based on weighted
model counting. To handle multiple queries efficiently, the lifted junction
tree algorithm (LJT) uses a first-order cluster representation of a model and
LVE as a subroutine in its computations. For certain inputs, the
implementations of LVE and, as a result, LJT ground parts of a model where FOKC
has a lifted run. The purpose of this paper is to prepare LJT as a backbone for
lifted inference and to use any exact inference algorithm as subroutine. Using
FOKC in LJT allows us to compute answers faster than LJT, LVE, and FOKC for
certain inputs.

6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
18
The categories of this paper are: econ
2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an