Reasoning about typicality in low complexity DLs: The logics EL ⊥Tminand DL-LitecTmin

Laura Giordano; Valentina Gliozzi; Nicola Olivetti; Gian Luca Pozzato

doi:10.5591/978-1-57735-516-8/IJCAI11-155

Reasoning about typicality in low complexity DLs: The logics EL ^⊥T_minand DL-Lite_cT_min

Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato

Department of Science and Technological Innovation

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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

Original language	English
Title of host publication	IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pages	894-899
Number of pages	6
DOIs	https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-155
Publication status	Published - 2011
Event	22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain Duration: 16 Jul 2011 → 22 Jul 2011

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)	1045-0823

Conference

Conference	22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
Country/Territory	Spain
City	Barcelona, Catalonia
Period	16/07/11 → 22/07/11

Access to Document

10.5591/978-1-57735-516-8/IJCAI11-155

Cite this

@inproceedings{bad558a505ce4594b77597f86e54660e,

title = "Reasoning about typicality in low complexity DLs: The logics EL ⊥Tminand DL-LitecTmin",

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 Π2p. 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 Π2p.",

author = "Laura Giordano and Valentina Gliozzi and Nicola Olivetti and Pozzato, {Gian Luca}",

year = "2011",

doi = "10.5591/978-1-57735-516-8/IJCAI11-155",

language = "English",

isbn = "9781577355120",

series = "IJCAI International Joint Conference on Artificial Intelligence",

pages = "894--899",

booktitle = "IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence",

note = "22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 ; Conference date: 16-07-2011 Through 22-07-2011",

}

Giordano, L, Gliozzi, V, Olivetti, N & Pozzato, GL 2011, Reasoning about typicality in low complexity DLs: The logics EL ^⊥T_minand DL-Lite_cT_min. in IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. IJCAI International Joint Conference on Artificial Intelligence, pp. 894-899, 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, 16/07/11. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-155

Reasoning about typicality in low complexity DLs: The logics EL ^⊥T_minand DL-Lite_cT_min. / Giordano, Laura; Gliozzi, Valentina; Olivetti, Nicola et al.
IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. 2011. p. 894-899 (IJCAI International Joint Conference on Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reasoning about typicality in low complexity DLs

T2 - 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

AU - Giordano, Laura

AU - Gliozzi, Valentina

AU - Olivetti, Nicola

AU - Pozzato, Gian Luca

PY - 2011

Y1 - 2011

N2 - 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 Π2p. 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 Π2p.

AB - 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 Π2p. 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 Π2p.

UR - http://www.scopus.com/inward/record.url?scp=84881047730&partnerID=8YFLogxK

U2 - 10.5591/978-1-57735-516-8/IJCAI11-155

DO - 10.5591/978-1-57735-516-8/IJCAI11-155

M3 - Conference contribution

AN - SCOPUS:84881047730

SN - 9781577355120

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 894

EP - 899

BT - IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence

Y2 - 16 July 2011 through 22 July 2011

ER -