4 citations · 6 across the 7 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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.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…
cs.LO2023★ 2 cited
Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination
Lukas Gerlach, David Carral
The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, thi…