Roman Kontchakov ; Ian Pratt-Hartmann ; Frank Wolter ; Michael Zakharyaschev - Spatial logics with connectedness predicates

lmcs:1229 - Logical Methods in Computer Science, August 18, 2010, Volume 6, Issue 3 - https://doi.org/10.2168/LMCS-6(3:7)2010
Spatial logics with connectedness predicates

Authors: Roman Kontchakov ; Ian Pratt-Hartmann ; Frank Wolter ; Michael Zakharyaschev

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.


Volume: Volume 6, Issue 3
Published on: August 18, 2010
Accepted on: June 25, 2015
Submitted on: June 17, 2009
Keywords: Computer Science - Logic in Computer Science,F.4.1, I.2.4


Share

Consultation statistics

This page has been seen 278 times.
This article's PDF has been downloaded 469 times.