BIROn - Birkbeck Institutional Research Online

On decidability and tractability of querying in temporal EL

Gutierrez Basulto, V. and Jung, J.C. and Kontchakov, Roman (2016) On decidability and tractability of querying in temporal EL. In: UNSPECIFIED (ed.) Proceedings of the 29th International Workshop on Description Logics. CEUR-WS.

[img]
Preview
Text
dl2016final.pdf - Author's Accepted Manuscript

Download (339kB) | Preview

Abstract

We study access to temporal data with TEL, a temporal extension of the tractable description logic EL. Our aim is to establish a clear computational complexity landscape for the atomic query answering problem, in terms of both data and combined complexity. Atomic queries in full TEL turn out to be undecidable even in data complexity. Motivated by the negative result, we identify well-behaved yet expressive fragments of TEL. Our main contributions are a semantic and sufficient syntactic conditions for decidability and three orthogonal tractable fragments, which are based on restricted use of rigid roles, temporal operators, and novel acyclicity conditions on the ontologies.

Metadata

Item Type: Book Section
Additional Information: Cape Town, South Africa, April 22-25, 2016. ISSN: 1613-0073
School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User: Roman Kontchakov
Date Deposited: 25 May 2016 14:38
Last Modified: 08 Aug 2025 13:39
URI: https://eprints.bbk.ac.uk/id/eprint/15316

Statistics

6 month trend
138Downloads
6 month trend
319Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item
Edit/View Item