ML Anthology

Reasoning About Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin

Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
IJCAI 2011 pp. 894-899
doi:10.5591/978-1-57735-516-8/IJCAI11-155 /ijcai/2011/giordano2011ijcai-reasoning/

Abstract

We propose a nonmonotonic extension of low complexity Description Logics EL⊥ and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. Concerning DL-LitecTmin, we prove that entailment is in Πp2. With regard to EL⊥Tmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local EL⊥Tmin and we prove that the complexity of entailment drops to Πp2

PDF IJCAI Semantic Scholar

Cite

Text

Giordano et al. "Reasoning About Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-155

Markdown

[Giordano et al. "Reasoning About Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/giordano2011ijcai-reasoning/) doi:10.5591/978-1-57735-516-8/IJCAI11-155

BibTeX

@inproceedings{giordano2011ijcai-reasoning,
  title     = {{Reasoning About Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin}},
  author    = {Giordano, Laura and Gliozzi, Valentina and Olivetti, Nicola and Pozzato, Gian Luca},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {894-899},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-155},
  url       = {https://mlanthology.org/ijcai/2011/giordano2011ijcai-reasoning/}
}