Robert Ferens

All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs

The chase is a famous algorithmic procedure in database theory with numerous applications in ontology-mediated query answering. We consider static analysis of the chase termination problem, which asks, given set of TGDs, whether the chase terminates on all input databases. The problem was rec…