Spatial logics with connectedness predicates

Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
• Keywords: CORR 2010, Education, Qualitative Spatial Representation, Quantifier-free Spatial Logics, Topological Connectedness