In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic ℘ script T sign ℒ, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and 'computational realisability' within the hierarchy. We demonstrate how different combining principles as well as spatial and temporal primitives can produce NP-, PSPACE-, EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out of components that are at most NP- or PSPACE-complete. © 2005 AI Access Foundation. All rights reserved.
CITATION STYLE
Gabelaia, D., Kontchakov, R., Kurucz, A., Wolter, F., & Zakharyaschev, M. (2005). Combining spatial and temporal logics: Expressiveness vs. Complexity. Journal of Artificial Intelligence Research, 23, 167–243. https://doi.org/10.1613/jair.1537
Mendeley helps you to discover research relevant for your work.