Abstract
In this paper we define an extension of a temporal description logic with a typicality operator, to allow for defeasible reasoning in a preferential temporal description logic. We show that a preferential extension of LTLAℒC with typicality can be polynomially encoded into LTLAℒC, and the approach allows borrowing some decidability and complexity results. We consider as well a multi-preferential temporal semantic for temporal weighted knowledge bases with typicality.
| Lingua originale | Inglese |
|---|---|
| Stato di pubblicazione | Pubblicato - 2023 |
| Evento | 38th Italian Conference on Computational Logic, CILC 2023 - Udine, Italia Durata: 1 gen 2023 → … |
???event.eventtypes.event.conference???
| ???event.eventtypes.event.conference??? | 38th Italian Conference on Computational Logic, CILC 2023 |
|---|---|
| Città | Udine, Italia |
| Periodo | 1/01/23 → … |