We show that the entailment problem, for a given entailment problem for DL-Lite$_{core}$ ontology, and given conjunctive query with inequalities, is undecidable. We also show that this problem remains undecidable if conjunctive queries with safe negation are considered instead of conjunctive queries with inequalities.

翻译：我们证明了对于给定的DL-Lite$_{core}$本体以及给定的带不等式合取查询，其蕴涵问题是不可判定的。同时，我们还证明了若将带不等式合取查询替换为带安全否定合取查询，该问题依然保持不可判定性。