AAAI Publications, Twenty-Fourth AAAI Conference on Artificial Intelligence

Font Size: 
Past and Future of DL-Lite
Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev

Last modified: 2010-07-03


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.


Description Logic; Temporal Logic; Conceptual Data Model

Full Text: PDF