IJCAI 2020 接收論文頗為嚴苛！在 4717 份有效投稿中，最終僅有 592 篇被接收，接收率為 12.6%，這也是 IJCAI 史上最低的接收率。
IJCAI: International Joint Conference on Artificial Intelligence，是人工智能領域國際頂級學術會議之一，也是中國計算機學會（CCF）推薦的人工智能領域A類會議。
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it is decidable to recognize if a set of rules is bounded for several classes and outline the complexity of the problem. This report contains the paper published at IJCAI 2019 and an appendix with full proofs.