A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
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 recently shown to be undecidable by Gogacz et al. for sets of rules containing only ternary predicates. In this work, we show that undecidability occurs already for sets of single-head TGD over binary
doi:10.24963/ijcai.2020/234
dblp:conf/ijcai/CuteriDRS20
fatcat:yikrojho75dkrh6cecq6dq2ypa