On the complexity of EL with defeasible inclusions
Piero Bonatti, Marco Faella and Luigi Sauro
We analyze the complexity of reasoning in EL with defeasible inclusions and extensions thereof. Previous results are extended by proving tight lower complexity bounds and by relaxing syntactic restrictions. We further extend the old framework by supporting arbitrary priority relations. We show that these extensions do not increase the complexity of the standard reasoning tasks.