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

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

Risultato della ricerca: Capitolo in libro/report/atti di convegnoContributo a conferenzapeer review

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 ELTmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local ELTmin and we prove that the complexity of entailment drops to Π2p.

Lingua originaleInglese
Titolo della pubblicazione ospiteIJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pagine894-899
Numero di pagine6
DOI
Stato di pubblicazionePubblicato - 2011
Evento22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
Durata: 16 lug 201122 lug 2011

Serie di pubblicazioni

NomeIJCAI International Joint Conference on Artificial Intelligence
ISSN (stampa)1045-0823

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
Paese/TerritorioSpain
CittàBarcelona, Catalonia
Periodo16/07/1122/07/11

Fingerprint

Entra nei temi di ricerca di 'Reasoning about typicality in low complexity DLs: The logics EL Tminand DL-LitecTmin'. Insieme formano una fingerprint unica.

Cita questo