Chase Termination - Analytical Hierarchy, Disjunctions, Sufficient Conditions

Lukas GerlachLukas Gerlach

Slides

Lukas Gerlach
Chase Termination - Analytical Hierarchy, Disjunctions, Sufficient Conditions
Talk at Description Logics Seminar, April 2025

Details
Bibtex

KurzfassungAbstract
In this talk, I'll be giving an overview of my recent and ongoing works revolving around chase termination. The chase is a fundamental algorithm for reasoning with ontologies featuring existential rules. There are different nuances when asking for termination of this algorithm. While all of these questions are undecidable, some are more undecidable than others. We have recently shown that a particular termination question is complete for the first level of the analytical hierarchy. I'll also give a recap on advances that we have made in the recent years in pushing generality of some sufficient conditions for chase termination and non-termination, particularly for existential rules that also allow disjunctions.
Weitere Informationen unter:Further Information: Link
Projekt:Project: CPEC, SECAI, ScaDS.AI
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@misc{G2025,
  author = {Lukas Gerlach},
  title  = {Chase Termination - Analytical Hierarchy, Disjunctions, Sufficient
            Conditions},
  year   = {2025},
  month  = {April}
}