Ryzhikov, Vladislav and Walega, P.A. and Zakharyaschev, Michael (2019) Data complexity and rewritability of ontology-mediated queries in Metric Temporal Logic under the Event-Based Semantics. In: UNSPECIFIED (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19). International Joint Conferences on Artificial Intelligence Organization, pp. 1851-1857. ISBN 9780999241127.
Abstract
We investigate the data complexity of answering queries mediated by metric temporal logic ontologies under the event-based semantics assuming that data instances are finite timed words timestamped with binary fractions. We identify classes of ontology-mediated queries answering which can be done in AC0, NC1, L, NL, P, and coNP for data complexity, provide their rewritings to first-order logic and its extensions with primitive recursion, transitive closure or datalog, and establish lower complexity bounds.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| SWORD Depositor: | Mr Joe Tenant |
| Depositing User: | Mr Joe Tenant |
| Date Deposited: | 06 Aug 2019 11:31 |
| Last Modified: | 09 Aug 2023 12:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/28457 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
