# Reliance-Based Optimization of Existential Rule Reasoning

# Reliance-Based Optimization of Existential Rule Reasoning

*Talk by Alex Ivliev*

- Location: Online
- Start: 9. December 2021 at 9:45 am
- End: 9. December 2021 at 10:45 am
- Event series: Research Seminar Logic and AI
- iCal

In this work, we utilize these reliances to devise rule application strategies that optimize the chase procedure based on the following criteria: First, we try to minimize the number of times rules are applied during the chase, aiming to improve run times. Second, we want to avoid applying rules in a way which introduces redundant facts. The goal here is to minimize the size of the resulting model, ideally producing a core. While it is always possible to derive a core model in core-stratified rule sets, we show situations where our approach is guaranteed to produce cores even if the rule set is not stratified. Moreover, we give a detailed description of the algorithms necessary for detecting a reliance relationship between two given rules as well as prove their correctness. We implement our approach into the rule reasoning engine VLog and evaluate its effectiveness on several knowledge bases used for benchmarking as well as some real-world datasets. We find a significant improvement in the run times for a small portion of the considered knowledge bases and are able to match VLog in the remaining ones.

This is a diploma defense, the talk is online.

Link: https://bbb.tu-dresden.de/b/ali-zgz-l8d-52n