Subsumption and Instance Problem in ELH w.r.t. General TBoxes
Institut für Theoretische Informatik TU Dresden, Sebastian Brandt · 2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems remain tractable even when admitting general concept inclusion axioms and simple role inclusion axioms.