Sciweavers

Share
CORR
2010
Springer

Spatial logics with connectedness predicates

8 years 12 months ago
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.
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
Comments (0)
books