On the Complexity of EL with Defeasible Inclusions

  title={On the Complexity of EL with Defeasible Inclusions},
  author={Piero A. Bonatti and Marco Faella and Luigi Sauro},
We analyze the complexity of reasoning in EL with defeasible inclusions and extensions thereof. The results by Bonatti et al., 2009a are extended by proving tight lower complexity bounds and by relaxing the syntactic restrictions adopted there. We further extend the old framework by supporting arbitrary priority relations. 

From This Paper

Figures, tables, and topics from this paper.
6 Citations
23 References
Similar Papers

Similar Papers

Loading similar papers…