Abstract
The dynamic junction tree algorithm (LDJT) efficiently answers exact filtering and prediction queries for temporal probabilistic relational models by building and then reusing a first-order cluster representation of a knowledge base for multiple queries and time steps. To also support sequential online decision making, we extend the underling model of LDJT with action and utility nodes, resulting in parameterised probabilistic dynamic decision models, and introduce meuLDJT to efficiently solve the exact lifted temporal maximum expected utility problem, while also answering marginal queries efficiently.
Original language | English |
---|---|
Title of host publication | Canadian AI 2019: Advances in Artificial Intelligence |
Editors | Marie-Jean Meurs, Frank Rudzicz |
Number of pages | 7 |
Volume | 11489 LNAI |
Publisher | Springer, Cham |
Publication date | 24.04.2019 |
Pages | 380-386 |
ISBN (Print) | 978-3-030-18304-2 |
ISBN (Electronic) | 978-3-030-18305-9 |
DOIs | |
Publication status | Published - 24.04.2019 |
Event | 32nd Canadian Conference on Artificial Intelligence - Kingston, Canada Duration: 28.05.2019 → 31.05.2019 |
Research Areas and Centers
- Centers: Center for Artificial Intelligence Luebeck (ZKIL)
- Research Area: Intelligent Systems