Past and Future of DL-Lite

Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
2010 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
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.
doi:10.1609/aaai.v24i1.7580 fatcat:qoj3u7ryofayvhcwrtcgqzyvae