Description logics with decision problems within NP Is there any description logic where important decision problems (e.g. abox consistency or concept satisfiability) lie within NP with respect to their time complexity?

The well-researched family of $\mathcal{ALC}$-based logics might not work since even for $\mathcal{ALC}$, problems are PSpace-complete. Neither would the $\mathcal{EL}$ family since the problems are at least CoNP.

Some restriction thereof might work, though, although I couldn't find any so far.
Can see here https://www.w3.org/TR/owl2-profiles/#Computational_Properties  for OWL-EL, OWL-QL and OWL-RL