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 |
|---|---|
| Rivista | CEUR Workshop Proceedings |
| Volume | 3428 |
| Stato di pubblicazione | Pubblicato - 2023 |
| Evento | 38th Italian Conference on Computational Logic, CILC 2023 - Udine, Italy Durata: 21 giu 2023 → 23 giu 2023 |
Fingerprint
Entra nei temi di ricerca di 'Preferential Temporal Description Logics with Typicality and Weighted Knowledge Bases'. Insieme formano una fingerprint unica.Cita questo
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver