加载中…
We show that the entailment problem, for a given entailment problem for DL-Lite 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本