3 papers
cs.LO2026
The Chase in Lean -- Crafting a Formal Library for Existential Rule Research
Lukas Gerlach
The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge repr…
cs.DB2025
About the Multi-Head Linear Restricted Chase Termination
Lukas Gerlach, Lucas Larroque, Jerzy Marcinkowski +1
The chase is a ubiquitous algorithm in database theory. However, for existential rules (aka tuple-generating dependencies), its termination is not guaranteed, and even undecidable…
cs.LO2025
Restricted Chase Termination: You Want More than Fairness
David Carral, Lukas Gerlach, Lucas Larroque +1
The chase is a fundamental algorithm with ubiquitous uses in database theory. Given a database and a set of existential rules (aka tuple-generating dependencies), it iteratively ex…