Chase-Based Computation of Cores for Existential Rules
Chase-Based Computation of Cores for Existential Rules
Vortrag von Lukas Gerlach
- Veranstaltungsort: online
- Beginn: 16. September 2021 um 13:00
- Ende: 16. September 2021 um 14:30
- Event series: Research Seminar Logic and AI
- iCal
In our work, we strengthen the existing result and proof that restricted and core chase termination exactly coincide for core-stratified rule sets. This also implies that we can use sufficient conditions for restricted chase non-termination as sufficient conditions for the non-existence of finite universal models. We also find a new fragment of existential rules for which core chase termination is decidable based on an existing result that shows decidability of restricted chase termination for the same fragment and we conjecture that this even holds for a slightly larger fragment by generalizing the so-called Fairness Theorem, which is a key part of the decidability proof. For non-core-stratified rule sets, we investigate a possible heuristic for core computation and introduce the hybrid chase as a mixture of restricted and core chase as a new chase variant equivalent to the core chase.
This is a diploma thesis defence. It will be given online via BigBlueButton. To access the room, use one of the following links:
with ZIH-login:
https://selfservice.zih.tu-dresden.de/l/link.php?m=140092&p=6a50295d
without ZIH-login:
https://selfservice.zih.tu-dresden.de/link.php?m=140092&p=ea2e02f3