Parameterised Queries and Lifted Query Answering

Tanya Braun, Ralf Möller

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 languageEnglish
Title of host publicationProceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18
Number of pages7
Volume2018-July
PublisherInternational Joint Conferences on Artificial Intelligence Organization
Publication date01.07.2018
Pages4980-4986
ISBN (Print)978-099924112-7
DOIs
Publication statusPublished - 01.07.2018
Event27th International Joint Conference on Artificial Intelligence - Stockholm, Sweden
Duration: 13.07.201819.07.2018
Conference number: 140653

DFG Research Classification Scheme

  • 409-01 Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Parameterised Queries and Lifted Query Answering'. Together they form a unique fingerprint.

Cite this