Combining spatial and temporal logics: expressiveness vs. complexity

  • Authors:
  • David Gabelaia;Roman Kontchakov;Agi Kurucz;Frank Wolter;Michael Zakharyaschev

  • Affiliations:
  • Department of Computer Science, King's College London, London, UK;Department of Computer Science, King's College London, London, UK;Department of Computer Science, King's College London, London, UK;Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, King's College London, London, UK

  • Venue:
  • Journal of Artificial Intelligence Research
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 PT L, 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.