Parameterised Queries and Lifted Query Answering
Abstract
A standard approach for inference in probabilistic formalisms with first-order constructs is lifted variable elimination (LVE) for single queries. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) employs a first-order cluster representation of a model and LVE as a subroutine. Both algorithms answer conjunctive queries of propositional random variables, shattering the model on the query, which causes unnecessary groundings for conjunctive queries of interchangeable variables. This paper presents parameterised queries as a means to avoid groundings, applying the lifting idea to queries. Parameterised queries enable LVE and LJT to compute answers faster, while compactly representing queries and answers.
Cite
Text
Braun and Möller. "Parameterised Queries and Lifted Query Answering." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/691Markdown
[Braun and Möller. "Parameterised Queries and Lifted Query Answering." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/braun2018ijcai-parameterised/) doi:10.24963/IJCAI.2018/691BibTeX
@inproceedings{braun2018ijcai-parameterised,
title = {{Parameterised Queries and Lifted Query Answering}},
author = {Braun, Tanya and Möller, Ralf},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
pages = {4980-4986},
doi = {10.24963/IJCAI.2018/691},
url = {https://mlanthology.org/ijcai/2018/braun2018ijcai-parameterised/}
}