Past and Future of DL-Lite

Authors

  • Alessandro Artale Free University of Bozen-Bolzano
  • Roman Kontchakov Birkbeck College
  • Vladislav Ryzhikov Free University of Bozen-Bolzano
  • Michael Zakharyaschev Birkbeck College London

DOI:

https://doi.org/10.1609/aaai.v24i1.7580

Keywords:

Description Logic, Temporal Logic, Conceptual Data Model

Abstract

We design minimal temporal description logics that are capa- ble of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We show that, depending on the required types of temporal and atemporal constraints, the satisfiability problem for temporal knowledge bases in the resulting logics can be NLOGSPACE-, NP- and PSPACE-complete, as well as undecidable.

Downloads

Published

2010-07-03

How to Cite

Artale, A., Kontchakov, R., Ryzhikov, V., & Zakharyaschev, M. (2010). Past and Future of DL-Lite. Proceedings of the AAAI Conference on Artificial Intelligence, 24(1), 243-248. https://doi.org/10.1609/aaai.v24i1.7580

Issue

Vol. 24 No. 1 (2010): Twenty-Fourth AAAI Conference on Artificial Intelligence

Section

Knowledge Representation and Reasoning