Chase Termination for Guarded Existential Rules
The chase procedure is considered as one of the most fundamental algorithmic tools in database theory. It has been successfully applied to different database problems such as data exchange, and query answering and containment under constraints, to name a few. One of the central problems regarding the chase procedure is all-instance termination that is, given a set of Tuple-Generating Dependencies (TGDs) (a.k.a. existential rules); decide whether the chase under that set terminates, for every input database.