Proceedings

On the Complexity of EL with Defeasible Inclusions

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 762-766.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-134

Abstract

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.

Piero A. Bonatti, Marco Faella, and Luigi Sauro. 2011. On the Complexity of EL with Defeasible Inclusions. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 762–766. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-134
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards