A decidable temporal DL-Lite logic with undecidable first-order and datalog-rewritability of ontology-mediated atomic queries
Artale, A. and Gnatenko, A. and Ryzhikov, Vladislav and Zakhariyashchev, Michael (2023) A decidable temporal DL-Lite logic with undecidable first-order and datalog-rewritability of ontology-mediated atomic queries. In: Kutz, O. and Lutz, C. and Ozaki, A. (eds.) Proceedings of the 36th International Workshop on Description Logics (DL 2023). CEUR Workshop Proceedings 3515. CEUR.
|
Text
DL_2023_paper_9957-6.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (859kB) | Preview |
Abstract
We design a logic in the temporal DL-Lite family (with non-Horn role inclusions and restricted temporalised roles), for which answering ontology-mediated atomic queries (OMAQs) can be done in ExpSpace and even in PSpace for ontologies without existential quantification in the rule heads but determining FO-rewritability or (linear) Datalog-rewritability of OMAQs is undecidable. On the other hand, we show (by reduction to monadic disjunctive Datalog) that deciding FO-rewritability of OMAQs in the non-temporal fragment of our logic can be done in 3NExpTime.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Rhodes, Greece, September 2-4, 2023. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Vladislav Ryzhikov |
| Date Deposited: | 08 Nov 2023 12:51 |
| Last Modified: | 08 Nov 2023 15:31 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/51763 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |