Kontchakov, Roman and Pratt-Hartmann, I. and Wolter, F. and Zakharyaschev, Michael (2010) Spatial logics with connectedness predicates. Logical Methods in Computer Science 6 (3), pp. 1-43. ISSN 1860-5974.Full text not available from this repository.
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.
|School or Research Centre:||Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Information Systems|
|Date Deposited:||31 Mar 2011 10:25|
|Last Modified:||11 Oct 2016 12:02|
Archive Staff Only (login required)