Past and Future of DL-Lite

Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev

AAAI 2010 pp. 243-248

doi:10.1609/AAAI.V24I1.7580 /aaai/2010/artale2010aaai-past/

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.

PDF AAAI Semantic Scholar

Cite

Text

Artale et al. "Past and Future of DL-Lite." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7580

Markdown

[Artale et al. "Past and Future of DL-Lite." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/artale2010aaai-past/) doi:10.1609/AAAI.V24I1.7580

BibTeX

@inproceedings{artale2010aaai-past,
  title     = {{Past and Future of DL-Lite}},
  author    = {Artale, Alessandro and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2010},
  pages     = {243-248},
  doi       = {10.1609/AAAI.V24I1.7580},
  url       = {https://mlanthology.org/aaai/2010/artale2010aaai-past/}
}