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.
| Original language | English |
|---|---|
| Publication status | Published - 2023 |
| Event | 38th Italian Conference on Computational Logic, CILC 2023 - Udine, Italia Duration: 1 Jan 2023 → … |
Conference
| Conference | 38th Italian Conference on Computational Logic, CILC 2023 |
|---|---|
| City | Udine, Italia |
| Period | 1/01/23 → … |
Fingerprint
Dive into the research topics of 'Preferential Temporal Description Logics with Typicality and Weighted Knowledge Bases'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver