ML Anthology

On the Complexity of EL with Defeasible Inclusions

Piero A. Bonatti, Marco Faella, Luigi Sauro
IJCAI 2011 pp. 762-767
doi:10.5591/978-1-57735-516-8/IJCAI11-134 /ijcai/2011/bonatti2011ijcai-complexity/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Bonatti et al. "On the Complexity of EL with Defeasible Inclusions." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-134

Markdown

[Bonatti et al. "On the Complexity of EL with Defeasible Inclusions." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/bonatti2011ijcai-complexity/) doi:10.5591/978-1-57735-516-8/IJCAI11-134

BibTeX

@inproceedings{bonatti2011ijcai-complexity,
  title     = {{On the Complexity of EL with Defeasible Inclusions}},
  author    = {Bonatti, Piero A. and Faella, Marco and Sauro, Luigi},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {762-767},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-134},
  url       = {https://mlanthology.org/ijcai/2011/bonatti2011ijcai-complexity/}
}