Artale, A. and Gnatenko, A. and Ryzhikov, Vladislav and Zakhariyashchev, Michael (2025) On deciding the data complexity of answering Linear Monadic Datalog Queries with LTL Operators. In: Roy, S. and Kara, A. (eds.) 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs) 328. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-19. ISBN 9783959773645.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
LIPIcs.ICDT.2025.31.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (1MB) |
Abstract
Our concern is the data complexity of answering linear monadic datalog queries whose atoms in the rule bodies can be prefixed by operators of linear temporal logic LTL. We first observe that, for data complexity, answering any connected query with operators ○/○- (at the next/previous moment) is either in AC⁰, or in ACC⁰\AC⁰, or NC¹-complete, or L-hard and in NL. Then we show that the problem of deciding L-hardness of answering such queries is PSpace-complete, while checking membership in the classes AC⁰ and ACC⁰ as well as NC¹-completeness can be done in ExpSpace. Finally, we prove that membership in AC⁰ or in ACC⁰, NC¹-completeness, and L-hardness are undecidable for queries with operators ◇/◇- (sometime in the future/past) provided that NC¹ ≠ NL and L ≠ NL.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | ICDT 2025, March 25-28, 2025, Barcelona, Spain |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Vladislav Ryzhikov |
| Date Deposited: | 06 Jun 2025 13:48 |
| Last Modified: | 12 Sep 2025 13:54 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/55539 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
