AAAI Publications, Twenty-Second International Joint Conference on Artificial Intelligence

Font Size: 
On the Complexity of EL with Defeasible Inclusions
Piero A. Bonatti, Marco Faella, Luigi Sauro

Last modified: 2011-06-28


We analyze the complexity of reasoning in EL with defeasible inclusions, and extend previous results by tightening lower and upper complexity bounds and by relaxing some syntactic restrictions. We further extend the old framework by supporting arbitrary priority relations over defeasible inclusions.

Full Text: PDF