Chase-Based Computation of Cores for Existential Rules
Chase-Based Computation of Cores for Existential Rules
Diplomarbeit von Lukas Gerlach
- Betreuer Markus Krötzsch
- Wissensbasierte Systeme
- 01. April 2021 – 29. August 2021
- Download
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.