# Subsumption and Instance Problem in ELH w.r.t. General TBoxes

##### S. BrandtS. Brandt
S. Brandt
Subsumption and Instance Problem in ELH w.r.t. General TBoxes
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume LTCS-04-04, 2004. LTCS-Report
• KurzfassungAbstract
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.
• Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
• Forschungsgruppe:Research Group: Automatentheorie
@techreport{ Brandt-LTCS-04-04,
title = {Subsumption and Instance Problem in $\mathcal{ELH}$ w.r.t.\ General TBoxes},