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. © 2018 International Joint Conferences on Artificial Intelligence.All right reserved.
Original language | English |
---|---|
Title of host publication | Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18 |
Number of pages | 7 |
Volume | 2018-July |
Publisher | International Joint Conferences on Artificial Intelligence Organization |
Publication date | 01.07.2018 |
Pages | 4980-4986 |
ISBN (Print) | 978-099924112-7 |
DOIs | |
Publication status | Published - 01.07.2018 |
Event | 27th International Joint Conference on Artificial Intelligence - Stockholm, Sweden Duration: 13.07.2018 → 19.07.2018 Conference number: 140653 |
DFG Research Classification Scheme
- 4.43-01 Theoretical Computer Science