Past and future of DL-Lite
Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2010) Past and future of DL-Lite. In: Fox, M. and Poole, D. (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. California, U.S.: AAAI Press, pp. 243-248. ISBN 9781577354659.
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | School of Business, Economics & Informatics > Computer Science and Information Systems |
| Depositing User: | Administrator |
| Date Deposited: | 13 May 2013 14:09 |
| Last Modified: | 02 Mar 2021 07:05 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/6717 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |