5 papers
Will My Favorite Chases Terminate if Evaluating Conjunctive Queries Does? One Does Not Simply Decide This
Lucas Larroque, Quentin Manière
Existential rules are a prominent formalism to enrich a database with knowledge from the domain of interest, but make even basic reasoning tasks on the resulting knowledge base und…
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture
Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo
This paper addresses one of the fundamental open questions in the realm of existential rules: the conjecture on the finite controllability of bounded derivation depth rule sets (bd…
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…
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…
Normalisations of Existential Rules: Not so Innocuous!
David Carral, Lucas Larroque, Marie-Laure Mugnier +1
Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simp…