Spatial logics with connectedness predicates
Logic in Computer Science
2015-07-01 v3
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.
Keywords
Cite
@article{arxiv.1003.5399,
title = {Spatial logics with connectedness predicates},
author = {Roman Kontchakov and Ian Pratt-Hartmann and Frank Wolter and Michael Zakharyaschev},
journal= {arXiv preprint arXiv:1003.5399},
year = {2015}
}
Comments
Some results of the paper were presented at LPAR 2008 and ECAI 2000