---
title: "On the Complexity of EL with Defeasible Inclusions"
authors:
  - "Piero A. Bonatti"
  - "Marco Faella"
  - "Luigi Sauro"
doi: "10.5591/978-1-57735-516-8/IJCAI11-134"
url: "https://ijcai.org/proceedings/2011/134"
pdf: "https://ijcai.org/proceedings/2011/0134.pdf"
venue: "Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence"
year: 2011
pages: "762-766"
track: ""
keywords:
---

# On the Complexity of EL with Defeasible Inclusions

Piero A. Bonatti, Marco Faella, Luigi Sauro

*Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence*, pages 762-766. DOI: [10.5591/978-1-57735-516-8/IJCAI11-134](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.