We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb Self reg OIQ) over quasi-forests and establish its NP-completeness. This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family). Using the same technique, we establish coNEXPTIME-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.

翻译：我们研究了非常具有表达力的描述逻辑ZOIQ（又称ALCHb Self reg OIQ）在拟森林上的可满足性问题的数据复杂度，并确定了其NP完全性。这完善了ZOIQ可判定片段的数据复杂度图景，并重新证明了关于OWL2（SR家族）可判定片段的已知结果。利用相同技术，我们建立了ZIQ中根查询的蕴含问题的coNEXPTIME完全性（关于组合复杂度）。